VMCAI 2011 Accepted Papers

Nuno Lopes and Andrey Rybalchenko. Distributed and Predictable Software Model Checking
Eric Goubault and Sylvie Putot. Static analysis of finite precision computations
Pieter Hooimeijer and Margus Veanes. An Evaluation of Automata Algorithms for String Analysis
Aaron Bradley. SAT-Based Model Checking Without Unrolling
Thomas Martin Gawlitza, Peter Lammich, Markus Markus Müller-Olm, Helmut Seidl and Alexander Wenner. Join-Lock-Sensitive Forward Reachability Analysis of Concurrent Programs with Dynamic Process Creation
Se-won Kim and Kwang-Moo Choe. String analysis as an Abstract interpretation
Sebastien Bardin, Philippe Herrmann and Franck Vedrine. Refinement-based CFG Reconstruction from Unstructured Programs
Byron Cook, Jasmin Fisher, Elzbieta Krepska and Nir Piterman. Proving stabilization of biological systems
Alastair Donaldson, Leopold Haller and Daniel Kroening. Strengthening Induction-Based Race Checking with Lightweight Static Analysis
Chih-Hong Cheng, Christian Buckl, Alois Knoll and Harald Ruess. Synthesis of Fault-Tolerant Embedded Systems using Games: from Theory to Practice
Elvira Albert, Samir Genaim and Abu Naser Masud. More Precise yet Widely-Applicable Cost Analysis
Rohit Chadha, A. Prasad Sistla and Mahesh Viswanathan. Probabilistic Buchi Automata with non-extremal acceptance thresholds
Axel Legay, Andrzej Wasowski, Kim G. Larsen, Benoit Delahaye, Mikkel Larsen Pedersen, Joost-Pieter Katoen and Falak Sher. Abstract Probabilistic Automata
Alexander Gotmanov, Satrajit Chatterjee and Mike Kishinevsky. Verifying Deadlock-Freedom of Communication Fabrics
Hakjoo Oh, Lucas Brutschy and Kwangkeun Yi. Access Analysis-Based Tight Localization of Abstract Memories
Philippe Suter, Robin Steiger and Viktor Kuncak. Sets with Cardinality Constraints in Satisfiability Modulo Theories
Ruzica Piskac and Thomas Wies. Decision Procedures for Automating Termination Proofs
Falk Howar, Bernhard Steffen and Maik Merten. Automata Learning with Automated Alphabet Abstraction Refinement
Swen Jacobs and Viktor Kuncak. Towards Complete Reasoning about Axiomatic Specifications
Robert Frohardt, Bor-Yuh Evan Chang and Sriram Sankaranarayanan. Access Nets: Modeling Access to Physical Spaces
Patrick Cousot, Radhia Cousot and Francesco Logozzo. Contract Precondition Inference from Intermittent Assertions on Collections
Shuvendu Lahiri and Julien Vanegue. ExplainHoudini: Making Houdini inference transparent
Angelo Brillout, Daniel Kroening, Philipp Ruemmer and Thomas Wahl. Beyond Quantifier-free Interpolation in Extensions of Presburger Arithmetic
Stephen F. Siegel and Timothy Zirkel. Collective Assertions