SAS B

28 papers

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