SAS 2011

27 papers

1. A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs · Matthew Might, David Van Horn
2. Abstract Domains of Affine Relations · Matt Elder, Junghee Lim, Tushar Sharma, Tycho Andersen, Thomas W. Reps
3. An Abstraction-Refinement Framework for Trigger Querying · Guy Avni, Orna Kupferman
4. An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs · Jeff Huang, Charles Zhang
5. Astrée: Design and Experience · Daniel Kästner
6. Bound Analysis of Imperative Programs with the Size-Change Abstraction · Florian Zuleger, Sumit Gulwani, Moritz Sinn, Helmut Veith
7. Directed Symbolic Execution · Kin-Keung Ma, Yit Phang Khoo, Jeffrey S. Foster, Michael Hicks
8. Efficient Decision Procedures for Heaps Using STRAND · P. Madhusudan, Xiaokang Qiu
9. Formal Model Reduction · Jérôme Feret
10. Invisible Invariants and Abstract Interpretation · Kenneth L. McMillan, Lenore D. Zuck
11. Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs · Peter Schrammel, Bertrand Jeannet
12. On Sequentializing Concurrent Programs · Ahmed Bouajjani, Michael Emmi, Gennaro Parlato
13. Probabilistic Abstractions with Arbitrary Domains · Javier Esparza, Andreas Gaiser
14. Probabilistically Accurate Program Transformations · Sasa Misailovic, Daniel M. Roy, Martin C. Rinard
15. Program Analysis and Machine Learning: A Win-Win Deal · Aditya V. Nori, Sriram K. Rajamani
16. Program Analysis for Web Security · John C. Mitchell
17. Purity Analysis: An Abstract Interpretation Formulation · Ravichandhran Madhavan, Ganesan Ramalingam, Kapil Vaswani
18. Satisfiability Modulo Recursive Programs · Philippe Suter, Ali Sinan Köksal, Viktor Kuncak
19. Side-Effect Analysis of Assembly Code · Andrea Flexeder, Michael Petter, Helmut Seidl
20. Software Verification Using k-Induction · Alastair F. Donaldson, Leopold Haller, Daniel Kroening, Philipp Rümmer
21. Statically Validating Must Summaries for Incremental Compositional Dynamic Test Generation · Patrice Godefroid, Shuvendu K. Lahiri, Cindy Rubio-González
22. The Complexity of Abduction for Separated Heap Abstractions · Nikos Gorogiannis, Max I. Kanovich, Peter W. O'Hearn
23. The Flow-Insensitive Precision of Andersen's Analysis in Practice · Sam Blackshear, Bor-Yuh Evan Chang, Sriram Sankaranarayanan, Manu Sridharan
24. Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations · Sven Verdoolaege, Albert Cohen, Anna Beletska
25. Using Bounded Model Checking to Focus Fixpoint Iterations · David Monniaux, Laure Gonnord
26. Verifying Fence Elimination Optimisations · Viktor Vafeiadis, Francesco Zappa Nardelli
27. Widening and Interpolation · Kenneth L. McMillan