VMCAI 2009
29 papers
- A PosterioriSoundness for Non-deterministic Abstract Interpretations
- A Scalable Memory Model for Low-Level Code
- Abstraction Refinement for Probabilistic Software
- Advances in Program Termination and Liveness
- An Abort-Aware Model of Transactional Programming
- An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries
- An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
- Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
- Constraint-Based Invariant Inference over Predicate Abstraction
- Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking
- Deciding Extensions of the Theories of Vectors and Bags
- Extending Symmetry Reduction by Exploiting System Architecture
- Finding Concurrency-Related Bugs Using Random Isolation
- LTL Generalized Model Checking Revisited
- Mixed Transition Systems Revisited
- Model Checking Concurrent Programs
- Model Checking: Progress and Problems
- Model-Checking the Linux Virtual File System
- Monitoring the Full Range of omega-Regular Properties of Stochastic Systems
- Mostly-Functional Behavior in Java Programs
- Query-Driven Program Testing
- Reducing Behavioural to Structural Properties of Programs with Procedures
- Shape-Value Abstraction for Verifying Linearizability
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
- Synthesizing Switching Logic Using Constraint Solving
- The Higher-Order Aggregate Update Problem
- Thread-Modular Shape Analysis
- Towards Automatic Stability Analysis for Rely-Guarantee Proofs
- Verification of Security Protocols