SAS 2010

28 papers

1. A Shape Analysis for Non-linear Data Structures · Renato Cherini, Lucas Rearte, Javier O. Blanco
2. Abstract Interpreters for Free · Matthew Might
3. Alternation for Termination · William R. Harris, Akash Lal, Aditya V. Nori, Sriram K. Rajamani
4. Automatic Abstraction for Intervals Using Boolean Formulae · Jörg Brauer, Andy King
5. Automatic Verification of Determinism for Structured Parallel Programs · Martin T. Vechev, Eran Yahav, Raghavan Raman, Vivek Sarkar
6. Boxes: A Symbolic Abstract Domain of Boxes · Arie Gurfinkel, Sagar Chaki
7. Compositional Bitvector Analysis for Concurrent Programs with Nested Locks · Azadeh Farzan, Zachary Kincaid
8. Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely · Thomas Martin Gawlitza, Helmut Seidl
9. Concurrent Separation Logic for Pipelined Parallelization · Christian J. Bell, Andrew W. Appel, David Walker
10. Deriving Numerical Abstract Domains via Principal Component Analysis · Gianluca Amato, Maurizio Parton, Francesca Scozzari
11. From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis · Elvira Albert, Puri Arenas, Samir Genaim, German Puebla, Diana V. Ramírez-Deantes
12. Generating Invariants for Non-linear Hybrid Systems by Linear Algebraic Methods · Nadir Matringe, Arnaldo Vieira Moura, Rachid Rebiha
13. Interprocedural Analysis with Lazy Propagation · Simon Holm Jensen, Anders Møller, Peter Thiemann
14. Interval Slopes as a Numerical Abstract Domain for Floating-Point Variables · Alexandre Chapoutot
15. Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods · Joost-Pieter Katoen, Annabelle McIver, Larissa Meinicke, Carroll C. Morgan
16. Modelling Metamorphism by Abstract Interpretation · Mila Dalla Preda, Roberto Giacobazzi, Saumya K. Debray, Kevin Coogan, Gregg M. Townsend
17. Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs · Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord
18. Points-to Analysis as a System of Linear Equations · Rupesh Nasre, Ramaswamy Govindarajan
19. Size-Change Termination and Transition Invariants · Matthias Heizmann, Neil D. Jones, Andreas Podelski
20. Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis · Isil Dillig, Thomas Dillig, Alex Aiken
21. Static Verification for Code Contracts · Manuel Fähndrich
22. Statically Inferring Complex Heap, Array, and Numeric Invariants · Bill McCloskey, Thomas W. Reps, Mooly Sagiv
23. Strictness Meets Data Flow · Tom Schrijvers, Alan Mycroft
24. Thread-Modular Counterexample-Guided Abstraction Refinement · Alexander Malkis, Andreas Podelski, Andrey Rybalchenko
25. Time of Time · E. Allen Emerson
26. Translation Validation of Loop Optimizations and Software Pipelining in the TVOC Framework - In Memory of Amir Pnueli · Benjamin Goldberg
27. Using Static Analysis in Space: Why Doing so? · David Lesens
28. Verifying a Local Generic Solver in Coq · Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl