CAV 2006
49 papers
- A Fast Linear-Arithmetic Solver for DPLL(T)
- Abstraction for Shape Analysis with Fast and Precise Transformers
- Allen Linear (Interval) Temporal Logic - Translation to LTL and Monitor Synthesis
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation
- Automatic Termination Proofs for Programs with Shape-Shifting Heaps
- Bounded Model Checking for Weak Alternating Büchi Automata
- Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
- CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools
- Causal Atomicity
- Check It Out: On the Efficient Formal Verification of Live Sequence Charts
- Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
- Counterexamples with Loops for Predicate Abstraction
- Deriving Small Unsatisfiable Cores with Dominators
- DiVinE - A Tool for Distributed Verification
- Don't Care Words with an Application to the Automata-Based Approach for Real Addition
- EverLost: A Flexible Platform for Industrial-Strength Abstraction-Guided Simulation
- FAST Extended Release
- Fast and Generalized Polynomial Time Memory Consistency Verification
- Formal Specifications on Industrial-Strength Code-From Myth to Reality
- Formal Verification of a Lazy Concurrent List-Based Set Algorithm
- I Think I Voted: E-Voting vs. Democracy
- Improving Pushdown System Model Checking
- LEVER: A Tool for Learning Based Verification
- Languages of Nested Trees
- Lazy Abstraction with Interpolants
- Lazy Shape Analysis
- Lookahead Widening
- Minimizing Generalized Büchi Automata
- Model Checking Multithreaded Programs with Asynchronous Atomic Methods
- Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs
- Programs with Lists Are Counter Automata
- Repair of Boolean Programs with an Application to C
- SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation
- SMT Techniques for Fast Predicate Abstraction
- Safraless Compositional Synthesis
- Some Complexity Results for SystemVerilog Assertions
- Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions
- Symmetry Reduction for Probabilistic Model Checking
- Termination Analysis with Calling Context Graphs
- Termination of Integer Linear Programs
- Terminator: Beyond Safety
- The Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover
- The Ideal of Verified Software
- The Power of Hybrid Acceleration
- Ticc: A Tool for Interface Compatibility and Composition
- Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop
- Yasm: A Software Model-Checker for Verification and Refutation
- cascade: C Assertion Checker and Deductive Engine