Abstract is missing.
- Transforming Abstract Interpretations by Abstract InterpretationRoberto Giacobazzi, Isabella Mastroeni. 1-17 [doi]
- Reflections on the Role of Static Analysis in Cooperative Bug IsolationBen Liblit. 18-31 [doi]
- Relational Analysis of CorrelationJörg Bauer, Flemming Nielson, Hanne Riis Nielson, Henrik Pilegaard. 32-46 [doi]
- Convex Hull of Arithmetic AutomataJérôme Leroux. 47-61 [doi]
- Pointer Analysis, Conditional Soundness, and Proving the Absence of ErrorsChristopher L. Conway, Dennis Dams, Kedar S. Namjoshi, Clark Barrett. 62-77 [doi]
- Protocol Inference Using Static Path ProfilesMurali Krishna Ramanathan, Koushik Sen, Ananth Grama, Suresh Jagannathan. 78-92 [doi]
- Solving Multiple Dataflow Queries Using WPDSsAkash Lal, Thomas W. Reps. 93-109 [doi]
- Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSAPrakash Prabhu, Priti Shankar. 110-127 [doi]
- Typing Linear Constraints for Moding CLP() ProgramsSalvatore Ruggieri, Frédéric Mesnard. 128-143 [doi]
- On Polymorphic Recursion, Type Systems, and Abstract InterpretationMarco Comini, Ferruccio Damiani, Samuel Vrech. 144-158 [doi]
- Modal Abstractions of Concurrent BehaviourSebastian Nanz, Flemming Nielson, Hanne Riis Nielson. 159-173 [doi]
- Hiding Software Watermarks in Loop StructuresMila Dalla Preda, Roberto Giacobazzi, Enrico Visentini. 174-188 [doi]
- Inferring Min and Max Invariants Using Max-Plus PolyhedraXavier Allamigeon, Stephane Gaubert, Eric Goubault. 189-204 [doi]
- Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and MonitorsPeter Lammich, Markus Müller-Olm. 205-220 [doi]
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost AnalysisElvira Albert, Puri Arenas, Samir Genaim, Germán Puebla. 221-237 [doi]
- SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language RefinementGogul Balakrishnan, Sriram Sankaranarayanan, Franjo Ivancic, Ou Wei, Aarti Gupta. 238-254 [doi]
- Flow Analysis, Linearity, and PTIMEDavid Van Horn, Harry G. Mairson. 255-269 [doi]
- Quantum Entanglement Analysis Based on Abstract InterpretationSimon Perdrix. 270-282 [doi]
- Language Strength ReductionNicholas Kidd, Akash Lal, Thomas W. Reps. 283-298 [doi]
- Analysing All Polynomial Equations in Helmut Seidl, Andrea Flexeder, Michael Petter. 299-314 [doi]
- Splitting the Control Flow with Boolean FlagsAxel Simon. 315-331 [doi]
- Reasoning about Control Flow in the Presence of Transient FaultsFrances Perry, David Walker. 332-346 [doi]
- A Calculational Approach to Control-Flow Analysis by Abstract InterpretationJan Midtgaard, Thomas P. Jensen. 347-362 [doi]
- Heap Decomposition for Concurrent Shape AnalysisRoman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine. 363-377 [doi]