VMCAI 2005
30 papers
- Abstract Interpretation with Alien Expressions and Heap Structures
- Abstraction for Liveness
- An Overview of Semantics for the Validation of Numerical Programs
- Automata as Abstractions
- Checking Herbrand Equalities and Beyond
- Cryptographic Protocol Analysis on Real C Code
- Don't Know in the µ-Calculus
- Efficient Verification of Halting Properties for MPI Programs with Wildcard Receives
- Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs
- Generalized Typestate Checking for Data Structure Consistency
- I/O Efficient Directed Model Checking
- Information Flow Analysis for Java Bytecode
- Minimizing Counterexample with Unit Core Extraction and Incremental SAT
- Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties
- Model Checking of Systems Employing Commutative Functions
- On the Complexity of Error Explanation
- Optimizing Bounded Model Checking for Linear Hybrid Systems
- Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists
- Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming
- Purity and Side Effect Analysis for Java Programs
- Scalable Analysis of Linear Systems Using Mathematical Programming
- Shape Analysis by Predicate Abstraction
- Simple Is Better: Efficient Bounded Model Checking for Past LTL
- Static Analysis by Abstract Interpretation of the Quasi-synchronous Composition of Synchronous Programs
- Termination of Polynomial Programs
- The Arithmetic-Geometric Progression Abstract Domain
- The Verifying Compiler, a Grand Challenge for Computing Research
- Verification of an Error Correcting Code by Abstract Interpretation
- Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement
- Weak Automata for the Linear Time µ-Calculus