Abstract is missing.
- Are Cells Asynchronous Circuits? - (Invited Talk)David L. Dill. 1 [doi]
- Formal Analysis of Message Passing - (Invited Talk)Stephen F. Siegel, Ganesh Gopalakrishnan. 2-18 [doi]
- Practical Verification for the Working Programmer with CodeContracts and Abstract Interpretation - (Invited Talk)Francesco Logozzo. 19-22 [doi]
- Quality Engineering: Leveraging Heterogeneous Information - (Invited Talk)Bernhard Steffen, Oliver Rüthing. 23-37 [doi]
- More Precise Yet Widely Applicable Cost AnalysisElvira Albert, Samir Genaim, Abu Naser Masud. 38-53 [doi]
- Refinement-Based CFG Reconstruction from Unstructured ProgramsSébastien Bardin, Philippe Herrmann, Franck Védrine. 54-69 [doi]
- SAT-Based Model Checking without UnrollingAaron R. Bradley. 70-87 [doi]
- Beyond Quantifier-Free Interpolation in Extensions of Presburger ArithmeticAngelo Brillout, Daniel Kroening, Philipp Rümmer, Thomas Wahl. 88-102 [doi]
- Probabilistic Büchi Automata with Non-extremal Acceptance ThresholdsRohit Chadha, A. Prasad Sistla, Mahesh Viswanathan. 103-117 [doi]
- Synthesis of Fault-Tolerant Embedded Systems Using Games: From Theory to PracticeChih-Hong Cheng, Harald Rueß, Alois Knoll, Christian Buckl. 118-133 [doi]
- Proving Stabilization of Biological SystemsByron Cook, Jasmin Fisher, Elzbieta Krepska, Nir Piterman. 134-149 [doi]
- Precondition Inference from Intermittent Assertions and Application to Contracts on CollectionsPatrick Cousot, Radhia Cousot, Francesco Logozzo. 150-168 [doi]
- Strengthening Induction-Based Race Checking with Lightweight Static AnalysisAlastair F. Donaldson, Leopold Haller, Daniel Kroening. 169-183 [doi]
- Access Nets: Modeling Access to Physical SpacesRobert Frohardt, Bor-Yuh Evan Chang, Sriram Sankaranarayanan. 184-198 [doi]
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process CreationThomas Martin Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner. 199-213 [doi]
- Verifying Deadlock-Freedom of Communication FabricsAlexander Gotmanov, Satrajit Chatterjee, Michael Kishinevsky. 214-231 [doi]
- Static Analysis of Finite Precision ComputationsEric Goubault, Sylvie Putot. 232-247 [doi]
- An Evaluation of Automata Algorithms for String AnalysisPieter Hooimeijer, Margus Veanes. 248-262 [doi]
- Automata Learning with Automated Alphabet Abstraction RefinementFalk Howar, Bernhard Steffen, Maik Merten. 263-277 [doi]
- Towards Complete Reasoning about Axiomatic SpecificationsSwen Jacobs, Viktor Kuncak. 278-293 [doi]
- String Analysis as an Abstract InterpretationSe-Won Kim, Kwang-Moo Choe. 294-308 [doi]
- ExplainHoudini: Making Houdini Inference TransparentShuvendu K. Lahiri, Julien Vanegue. 309-323 [doi]
- Abstract Probabilistic AutomataBenoît Delahaye, Joost-Pieter Katoen, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Falak Sher, Andrzej Wasowski. 324-339 [doi]
- Distributed and Predictable Software Model CheckingNuno P. Lopes, Andrey Rybalchenko. 340-355 [doi]
- Access Analysis-Based Tight Localization of Abstract MemoriesHakjoo Oh, Lucas Brutschy, Kwangkeun Yi. 356-370 [doi]
- Decision Procedures for Automating Termination ProofsRuzica Piskac, Thomas Wies. 371-386 [doi]
- Collective AssertionsStephen F. Siegel, Timothy K. Zirkel. 387-402 [doi]
- Sets with Cardinality Constraints in Satisfiability Modulo TheoriesPhilippe Suter, Robin Steiger, Viktor Kuncak. 403-418 [doi]