Abstract is missing.
- Computer-Aided Cryptographic ProofsGilles Barthe, Benjamin Grégoire, Santiago Zanella Béguelin. 1-2 [doi]
- A Voyage to the Deep-HeapDino Distefano. 3 [doi]
- Semantics and Analyses for JavaScript and the WebShriram Krishnamurthi. 4 [doi]
- Efficient May Happen in Parallel Analysis for Async-Finish ParallelismJonathan K. Lee, Jens Palsberg, Rupak Majumdar, Hong Hong. 5-23 [doi]
- Modular Static Analysis with ZonotopesEric Goubault, Sylvie Putot, Franck Védrine. 24-40 [doi]
- Polyhedral Analysis Using Parametric ObjectivesJacob M. Howe, Andy King. 41-57 [doi]
- Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner BasesDavid Cachera, Thomas P. Jensen, Arnaud Jobin, Florent Kirchner. 58-74 [doi]
- A New Abstract Domain for the Representation of Mathematically Equivalent ExpressionsArnault Ioualalen, Matthieu Martel. 75-93 [doi]
- An Abstract Domain to Infer Types over Zones in SpreadsheetsTie Cheng, Xavier Rival. 94-110 [doi]
- Bilateral Algorithms for Symbolic AbstractionAditya V. Thakur, Matt Elder, Thomas W. Reps. 111-128 [doi]
- Making Abstract Interpretation Incomplete: Modeling the Potency of ObfuscationRoberto Giacobazzi, Isabella Mastroeni. 129-145 [doi]
- Invariant Generation for Parametrized Systems Using Self-reflection - (Extended Version)Alejandro Sánchez, Sriram Sankaranarayanan, César Sánchez, Bor-Yuh Evan Chang. 146-163 [doi]
- Automatic Fence Insertion in Integer Programs via Predicate AbstractionParosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine. 164-180 [doi]
- Control Flow Analysis for the Join CalculusPeter Calvert, Alan Mycroft. 181-197 [doi]
- When the Decreasing Sequence FailsNicolas Halbwachs, Julien Henry. 198-213 [doi]
- Loop Leaping with ClosuresSebastian Biallas, Jörg Brauer, Andy King, Stefan Kowalewski. 214-230 [doi]
- Path-Sensitive Backward SlicingJoxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas, Andrew E. Santosa. 231-247 [doi]
- Symbolic Learning of Component InterfacesDimitra Giannakopoulou, Zvonimir Rakamaric, Vishwanath Raman. 248-264 [doi]
- Liveness-Based Pointer AnalysisUday P. Khedker, Alan Mycroft, Prashant Singh Rawat. 265-282 [doi]
- Succinct Representations for Abstract Interpretation - Combined Analysis Algorithms and Experimental EvaluationJulien Henry, David Monniaux, Matthieu Moy. 283-299 [doi]
- Craig InterpretationAws Albarghouthi, Arie Gurfinkel, Marsha Chechik. 300-316 [doi]
- Satisfiability Solvers Are Static AnalysersVijay D'Silva, Leopold Haller, Daniel Kroening. 317-333 [doi]
- A Generalization of Stålmarck's MethodAditya V. Thakur, Thomas W. Reps. 334-351 [doi]
- A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois ConnectionsJan Midtgaard, Michael D. Adams 0001, Matthew Might. 352-369 [doi]
- Modular Heap Analysis for Higher-Order ProgramsRavichandhran Madhavan, G. Ramalingam, Kapil Vaswani. 370-387 [doi]
- Binary Reachability Analysis of Higher Order Functional ProgramsRuslán Ledesma-Garza, Andrey Rybalchenko. 388-404 [doi]
- On the Limits of the Classical Approach to Cost AnalysisDiego Esteban Alonso-Blas, Samir Genaim. 405-421 [doi]
- Termination Proofs for Linear Simple LoopsHong Yi Chen, Shaked Flur, Supratik Mukhopadhyay. 422-438 [doi]
- Finding Non-terminating Executions in Distributed Asynchronous ProgramsMichael Emmi, Akash Lal. 439-455 [doi]