| Invited Talks | |
| Formal Specifications on Industrial-Strength Code-From Myth to Reality | p. 1 |
| I Think I Voted: E-Voting vs. Democracy | p. 2 |
| Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs | p. 3 |
| The Ideal of Verified Software | p. 5 |
| Automata | |
| Antichains: A New Algorithm for Checking Universality of Finite Automata | p. 17 |
| Safraless Compositional Synthesis | p. 31 |
| Minimizing Generalized Buchi Automata | p. 45 |
| Tools Papers | |
| Ticc: A Tool for Interface Compatibility and Composition | p. 59 |
| Fast Extended Release | p. 63 |
| Arithmetic | |
| Don't Care Words with an Application to the Automata-Based Approach for Real Addition | p. 67 |
| A Fast Linear-Arithmetic Solver for DPLL(T) | p. 81 |
| SAT and Bounded Model Checking | |
| Bounded Model Checking for Weak Alternating Buchi Automata | p. 95 |
| Deriving Small Unsatisfiable Cores with Dominators | p. 109 |
| Abstraction/Refinement | |
| Lazy Abstraction with Interpolants | p. 123 |
| Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop | p. 137 |
| Counterexamples with Loops for Predicate Abstraction | p. 152 |
| Tools Papers | |
| Cascade: C Assertion Checker and Deductive Engine | p. 166 |
| Yasm: A Software Model-Checker for Verification and Refutation | p. 170 |
| Symbolic Trajectory Evaluation | |
| SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation | p. 175 |
| Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation | p. 190 |
| Property Specification and Verification | |
| Some Complexity Results for System Verilog Assertions | p. 205 |
| Check It Out: On the Efficient Formal Verification of Live Sequence Charts | p. 219 |
| Time | |
| Symmetry Reduction for Probabilistic Model Checking | p. 234 |
| Communicating Timed Automata: The More Synchronous, the More Difficult to Verify | p. 249 |
| Allen Linear (Interval) Temporal Logic - Translation to LTL and Monitor Synthesis | p. 263 |
| Tools Papers | |
| DiVinE - A Tool for Distributed Verification | p. 278 |
| EverLost: A Flexible Platform for Industrial-Strength Abstraction-Guided Simulation | p. 282 |
| Concurrency | |
| Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions | p. 286 |
| Model Checking Multithreaded Programs with Asynchronous Atomic Methods | p. 300 |
| Causal Atomicity | p. 315 |
| Trees, Pushdown Systems and Boolean Programs | |
| Languages of Nested Trees | p. 329 |
| Improving Pushdown System Model Checking | p. 343 |
| Repair of Boolean Programs with an Application to C | p. 358 |
| Termination | |
| Termination of Integer Linear Programs | p. 372 |
| Automatic Termination Proofs for Programs with Shape-Shifting Heaps | p. 386 |
| Termination Analysis with Calling Context Graphs | p. 401 |
| Tools Papers | |
| Terminator: Beyond Safety | p. 415 |
| Cute and jCute: Concolic Unit Testing and Explicit Path Model-Checking Tools | p. 419 |
| Abstract Interpretation | |
| SMT Techniques for Fast Predicate Abstraction | p. 424 |
| The Power of Hybrid Acceleration | p. 438 |
| Lookahead Widening | p. 452 |
| Tools Papers | |
| The Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover | p. 467 |
| Lever: A Tool for Learning Based Verification | p. 471 |
| Memory Consistency | |
| Formal Verification of a Lazy Concurrent List-Based Set Algorithm | p. 475 |
| Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study | p. 489 |
| Fast and Generalized Polynomial Time Memory Consistency Verification | p. 503 |
| Shape Analysis | |
| Programs with Lists Are Counter Automata | p. 517 |
| Lazy Shape Analysis | p. 532 |
| Abstraction for Shape Analysis with Fast and Precise Transformers | p. 547 |
| Author Index | p. 563 |
| Table of Contents provided by Ingram. All Rights Reserved. |