Static Analysis

1. Front Matter

   PDF

2. Block Me If You Can!

   • Parosh Aziz Abdulla, Frédéric Haziza, Lukáš Holík

   Pages 1-17

3. Peak Cost Analysis of Distributed Systems

   • Elvira Albert, Jesús Correas, Guillermo Román-Díez

   Pages 18-33

4. Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction

   • Alexey Bakhirkin, Josh Berdine, Nir Piterman

   Pages 34-50

5. SawjaCard: A Static Analysis Tool for Certifying Java Card Applications

   • Frédéric Besson, Thomas Jensen, Pierre Vittet

   Pages 51-67

6. Cyclic Abduction of Inductively Defined Safety and Termination Preconditions

   • James Brotherston, Nikos Gorogiannis

   Pages 68-84

7. Expectation Invariants for Probabilistic Program Loops as Fixed Points

   • Aleksandar Chakarov, Sriram Sankaranarayanan

   Pages 85-100

8. An Abstract Domain to Infer Octagonal Constraints with Absolute Value

   • Liqian Chen, Jiangchao Liu, Antoine Miné, Deepak Kapur, Ji Wang

   Pages 101-117

9. Verifying Recursive Programs Using Intraprocedural Analyzers

   • Yu-Fang Chen, Chiao Hsieh, Ming-Hsien Tsai, Bow-Yaw Wang, Farn Wang

   Pages 118-133

10. Automatic Analysis of Open Objects in Dynamic Language Programs

    • Arlen Cox, Bor-Yuh Evan Chang, Xavier Rival

    Pages 134-150

11. Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations

    • Khalil Ghorbal, Andrew Sogokon, André Platzer

    Pages 151-167

12. On Program Equivalence with Reductions

    • Guillaume Iooss, Christophe Alias, Sanjay Rajopadhye

    Pages 168-183

13. A Progress Bar for Static Analyzers

    • Woosuk Lee, Hakjoo Oh, Kwangkeun Yi

    Pages 184-200

14. Sparse Dataflow Analysis with Pointers and Reachability

    • Magnus Madsen, Anders Møller

    Pages 201-218

15. Reactivity of Cooperative Systems

    • Louis Mandel, Cédric Pasteur

    Pages 219-236

16. Synthesis of Memory Fences via Refinement Propagation

    • Yuri Meshman, Andrei Dan, Martin Vechev, Eran Yahav

    Pages 237-252

17. Speeding Up Logico-Numerical Strategy Iteration

    • David Monniaux, Peter Schrammel

    Pages 253-267

18. Cost-Aware Automatic Program Repair

    • Roopsha Samanta, Oswaldo Olivo, E. Allen Emerson

    Pages 268-284

19. An Abstract Domain Combinator for Separately Conjoining Memory Abstractions

    • Antoine Toubhans, Bor-Yuh Evan Chang, Xavier Rival

    Pages 285-301

20. A Decision Tree Abstract Domain for Proving Conditional Termination

    • Caterina Urban, Antoine Miné

    Pages 302-318

This book constitutes the thoroughly refereed proceedings of the 21st International Symposium on Static Analysis, SAS 2014, held in Munich, Germany, in September 2014. The 20 revised full papers were selected from 53 submissions and are presented together with 3 invited talks. The papers address all aspects of static analysis, including abstract interpretation, abstract testing, bug detection, data flow analysis, model checking, program transformation, program verification, security analysis, and type checking.

• formal methods
• model checking
• program analysis
• program reasoning
• software engineering
• software functional properties
• software testing and debugging
• software validation
• software verification
• theory of computation

• Institut für Informatik, Westfälische Wilhelms-Universität Münster, Münster, Germany

  Markus Müller-Olm

• Institut für Informatik, Technische Universität München, Garching, Germany

  Helmut Seidl

Policies and ethics