Abstract is missing.
- Widening and InterpolationKenneth L. McMillan. 1 [doi]
- Program Analysis and Machine Learning: A Win-Win DealAditya V. Nori, Sriram K. Rajamani. 2-3 [doi]
- Program Analysis for Web SecurityJohn C. Mitchell. 4 [doi]
- Astrée: Design and ExperienceDaniel Kästner. 5 [doi]
- Formal Model ReductionJérôme Feret. 6 [doi]
- Purity Analysis: An Abstract Interpretation FormulationRavichandhran Madhavan, Ganesan Ramalingam, Kapil Vaswani. 7-24 [doi]
- The Complexity of Abduction for Separated Heap AbstractionsNikos Gorogiannis, Max I. Kanovich, Peter W. O'Hearn. 25-42 [doi]
- Efficient Decision Procedures for Heaps Using STRANDP. Madhusudan, Xiaokang Qiu. 43-59 [doi]
- The Flow-Insensitive Precision of Andersen's Analysis in PracticeSam Blackshear, Bor-Yuh Evan Chang, Sriram Sankaranarayanan, Manu Sridharan. 60-76 [doi]
- Side-Effect Analysis of Assembly CodeAndrea Flexeder, Michael Petter, Helmut Seidl. 77-94 [doi]
- Directed Symbolic ExecutionKin-Keung Ma, Yit Phang Khoo, Jeffrey S. Foster, Michael Hicks. 95-111 [doi]
- Statically Validating Must Summaries for Incremental Compositional Dynamic Test GenerationPatrice Godefroid, Shuvendu K. Lahiri, Cindy Rubio-González. 112-128 [doi]
- On Sequentializing Concurrent ProgramsAhmed Bouajjani, Michael Emmi, Gennaro Parlato. 129-145 [doi]
- Verifying Fence Elimination OptimisationsViktor Vafeiadis, Francesco Zappa Nardelli. 146-162 [doi]
- An Efficient Static Trace Simplification Technique for Debugging Concurrent ProgramsJeff Huang, Charles Zhang. 163-179 [doi]
- A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order ProgramsMatthew Might, David Van Horn. 180-197 [doi]
- Abstract Domains of Affine RelationsMatt Elder, Junghee Lim, Tushar Sharma, Tycho Andersen, Thomas W. Reps. 198-215 [doi]
- Transitive Closures of Affine Integer Tuple Relations and Their OverapproximationsSven Verdoolaege, Albert Cohen, Anna Beletska. 216-232 [doi]
- Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow ProgramsPeter Schrammel, Bertrand Jeannet. 233-248 [doi]
- Invisible Invariants and Abstract InterpretationKenneth L. McMillan, Lenore D. Zuck. 249-262 [doi]
- An Abstraction-Refinement Framework for Trigger QueryingGuy Avni, Orna Kupferman. 263-279 [doi]
- Bound Analysis of Imperative Programs with the Size-Change AbstractionFlorian Zuleger, Sumit Gulwani, Moritz Sinn, Helmut Veith. 280-297 [doi]
- Satisfiability Modulo Recursive ProgramsPhilippe Suter, Ali Sinan Köksal, Viktor Kuncak. 298-315 [doi]
- Probabilistically Accurate Program TransformationsSasa Misailovic, Daniel M. Roy, Martin C. Rinard. 316-333 [doi]
- Probabilistic Abstractions with Arbitrary DomainsJavier Esparza, Andreas Gaiser. 334-350 [doi]
- Software Verification Using k-InductionAlastair F. Donaldson, Leopold Haller, Daniel Kroening, Philipp Rümmer. 351-368 [doi]
- Using Bounded Model Checking to Focus Fixpoint IterationsDavid Monniaux, Laure Gonnord. 369-385 [doi]