


default search action
21. SAS 2014: Munich, Germany
- Markus Müller-Olm, Helmut Seidl:

Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8723, Springer 2014, ISBN 978-3-319-10935-0 - Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík:

Block Me If You Can! - Context-Sensitive Parameterized Verification. 1-17 - Elvira Albert, Jesús Correas Fernández, Guillermo Román-Díez

:
Peak Cost Analysis of Distributed Systems. 18-33 - Alexey Bakhirkin, Josh Berdine, Nir Piterman:

Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction. 34-50 - Frédéric Besson, Thomas P. Jensen, Pierre Vittet:

SawjaCard: A Static Analysis Tool for Certifying Java Card Applications. 51-67 - James Brotherston, Nikos Gorogiannis:

Cyclic Abduction of Inductively Defined Safety and Termination Preconditions. 68-84 - Aleksandar Chakarov, Sriram Sankaranarayanan:

Expectation Invariants for Probabilistic Program Loops as Fixed Points. 85-100 - Liqian Chen, Jiangchao Liu, Antoine Miné, Deepak Kapur, Ji Wang:

An Abstract Domain to Infer Octagonal Constraints with Absolute Value. 101-117 - Yu-Fang Chen

, Chiao Hsieh
, Ming-Hsien Tsai, Bow-Yaw Wang, Farn Wang:
Verifying Recursive Programs Using Intraprocedural Analyzers. 118-133 - Arlen Cox, Bor-Yuh Evan Chang, Xavier Rival:

Automatic Analysis of Open Objects in Dynamic Language Programs. 134-150 - Khalil Ghorbal, Andrew Sogokon, André Platzer:

Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations. 151-167 - Guillaume Iooss, Christophe Alias, Sanjay V. Rajopadhye

:
On Program Equivalence with Reductions. 168-183 - Woosuk Lee, Hakjoo Oh, Kwangkeun Yi:

A Progress Bar for Static Analyzers. 184-200 - Magnus Madsen

, Anders Møller:
Sparse Dataflow Analysis with Pointers and Reachability. 201-218 - Louis Mandel, Cédric Pasteur:

Reactivity of Cooperative Systems - Application to ReactiveML. 219-236 - Yuri Meshman, Andrei Marian Dan, Martin T. Vechev, Eran Yahav:

Synthesis of Memory Fences via Refinement Propagation. 237-252 - David Monniaux, Peter Schrammel

:
Speeding Up Logico-Numerical Strategy Iteration. 253-267 - Roopsha Samanta, Oswaldo Olivo, E. Allen Emerson:

Cost-Aware Automatic Program Repair. 268-284 - Antoine Toubhans, Bor-Yuh Evan Chang, Xavier Rival:

An Abstract Domain Combinator for Separately Conjoining Memory Abstractions. 285-301 - Caterina Urban

, Antoine Miné:
A Decision Tree Abstract Domain for Proving Conditional Termination. 302-318 - Sen Ye, Yulei Sui, Jingling Xue:

Region-Based Selective Flow-Sensitive Pointer Analysis. 319-336

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














