SAS 2012

29 papers

1. A Generalization of Stålmarck's Method · Aditya V. Thakur, Thomas W. Reps
2. A New Abstract Domain for the Representation of Mathematically Equivalent Expressions · Arnault Ioualalen, Matthieu Martel
3. A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections · Jan Midtgaard, Michael D. Adams, Matthew Might
4. A Voyage to the Deep-Heap · Dino Distefano
5. An Abstract Domain to Infer Types over Zones in Spreadsheets · Tie Cheng, Xavier Rival
6. Automatic Fence Insertion in Integer Programs via Predicate Abstraction · Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine
7. Bilateral Algorithms for Symbolic Abstraction · Aditya V. Thakur, Matt Elder, Thomas W. Reps
8. Binary Reachability Analysis of Higher Order Functional Programs · Ruslán Ledesma-Garza, Andrey Rybalchenko
9. Computer-Aided Cryptographic Proofs · Gilles Barthe, Benjamin Grégoire, Santiago Zanella-Béguelin
10. Control Flow Analysis for the Join Calculus · Peter Calvert, Alan Mycroft
11. Craig Interpretation · Aws Albarghouthi, Arie Gurfinkel, Marsha Chechik
12. Efficient May Happen in Parallel Analysis for Async-Finish Parallelism · Jonathan K. Lee, Jens Palsberg, Rupak Majumdar, Hong Hong
13. Finding Non-terminating Executions in Distributed Asynchronous Programs · Michael Emmi, Akash Lal
14. Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases · David Cachera, Thomas P. Jensen, Arnaud Jobin, Florent Kirchner
15. Invariant Generation for Parametrized Systems Using Self-reflection - (Extended Version) · Alejandro Sánchez, Sriram Sankaranarayanan, César Sánchez, Bor-Yuh Evan Chang
16. Liveness-Based Pointer Analysis · Uday P. Khedker, Alan Mycroft, Prashant Singh Rawat
17. Loop Leaping with Closures · Sebastian Biallas, Jörg Brauer, Andy King, Stefan Kowalewski
18. Making Abstract Interpretation Incomplete: Modeling the Potency of Obfuscation · Roberto Giacobazzi, Isabella Mastroeni
19. Modular Heap Analysis for Higher-Order Programs · Ravichandhran Madhavan, G. Ramalingam, Kapil Vaswani
20. Modular Static Analysis with Zonotopes · Eric Goubault, Sylvie Putot, Franck Védrine
21. On the Limits of the Classical Approach to Cost Analysis · Diego Esteban Alonso-Blas, Samir Genaim
22. Path-Sensitive Backward Slicing · Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas, Andrew E. Santosa
23. Polyhedral Analysis Using Parametric Objectives · Jacob M. Howe, Andy King
24. Satisfiability Solvers Are Static Analysers · Vijay Victor D'Silva, Leopold Haller, Daniel Kroening
25. Semantics and Analyses for JavaScript and the Web · Shriram Krishnamurthi
26. Succinct Representations for Abstract Interpretation - Combined Analysis Algorithms and Experimental Evaluation · Julien Henry, David Monniaux, Matthieu Moy
27. Symbolic Learning of Component Interfaces · Dimitra Giannakopoulou, Zvonimir Rakamaric, Vishwanath Raman
28. Termination Proofs for Linear Simple Loops · Hong Yi Chen, Shaked Flur, Supratik Mukhopadhyay
29. When the Decreasing Sequence Fails · Nicolas Halbwachs, Julien Henry