VMCAI 2011
28 papers
- Abstract Probabilistic Automata
- Access Analysis-Based Tight Localization of Abstract Memories
- Access Nets: Modeling Access to Physical Spaces
- An Evaluation of Automata Algorithms for String Analysis
- Are Cells Asynchronous Circuits? - (Invited Talk)
- Automata Learning with Automated Alphabet Abstraction Refinement
- Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic
- Collective Assertions
- Decision Procedures for Automating Termination Proofs
- Distributed and Predictable Software Model Checking
- ExplainHoudini: Making Houdini Inference Transparent
- Formal Analysis of Message Passing - (Invited Talk)
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
- More Precise Yet Widely Applicable Cost Analysis
- Practical Verification for the Working Programmer with CodeContracts and Abstract Interpretation - (Invited Talk)
- Precondition Inference from Intermittent Assertions and Application to Contracts on Collections
- Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds
- Proving Stabilization of Biological Systems
- Quality Engineering: Leveraging Heterogeneous Information - (Invited Talk)
- Refinement-Based CFG Reconstruction from Unstructured Programs
- SAT-Based Model Checking without Unrolling
- Sets with Cardinality Constraints in Satisfiability Modulo Theories
- Static Analysis of Finite Precision Computations
- Strengthening Induction-Based Race Checking with Lightweight Static Analysis
- String Analysis as an Abstract Interpretation
- Synthesis of Fault-Tolerant Embedded Systems Using Games: From Theory to Practice
- Towards Complete Reasoning about Axiomatic Specifications
- Verifying Deadlock-Freedom of Communication Fabrics