| Invited Talks | |
| Software Analysis and Model Checking | p. 1 |
| The Quest for Efficient Boolean Satisfiability Solvers | p. 17 |
| Invited Tutorials | |
| On Abstraction in Software Verification | p. 37 |
| The Symbolic Approach to Hybrid Systems | p. 57 |
| Infinite Games and Verification (Extended Abstract of a Tutorial) | p. 58 |
| Symbolic Model Checking | |
| Symbolic Localization Reduction with Reconstruction Layering and Backtracking | p. 65 |
| Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions | p. 78 |
| Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking | p. 93 |
| Abstraction/Refinement and Model Checking | |
| Liveness with (0,1, ∞)-Counter Abstraction | p. 107 |
| Shared Memory Consistency Protocol Verification Against Weak Memory Models: Refinement via Model-Checking | p. 123 |
| Automatic Abstraction Using Generalized Model Checking | p. 137 |
| Compositional/Structural Verification | |
| Property Checking via Structural Analysis | p. 151 |
| Conformance Checking for Models of Asynchronous Message Passing Software | p. 166 |
| A Modular Checker for Multithreaded Programs | p. 180 |
| Timing Analysis | |
| Automatic Derivation of Timing Constraints by Failure Analysis | p. 195 |
| Deciding Separation Formulas with SAT | p. 209 |
| Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling | p. 223 |
| SAT Based Methods | |
| Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT | p. 236 |
| Applying SAT Methods in Unbounded Symbolic Model Checking | p. 250 |
| SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques | p. 265 |
| Semi-formal Bounded Model Checking | p. 280 |
| Symbolic Model Checking | |
| Algorithmic Verification of Invalidation-Based Protocols | p. 295 |
| Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving | p. 309 |
| Automated Unbounded Verification of Security Protocols | p. 324 |
| Tool Presentations | |
| Exploiting Behavioral Hierarchy for Efficient Model Checking | p. 338 |
| IF-2.0: A Validation Environment for Component-Based Real-Time Systems | p. 343 |
| The AVISS Security Protocol Analysis Tool | p. 349 |
| SPeeDI - A Verification Tool for Polygonal Hybrid Systems | p. 354 |
| NuSMV 2: An OpenSource Tool for Symbolic Model Checking | p. 359 |
| The d/dt Tool for Verification of Hybrid Systems | p. 365 |
| Infinite State Model Checking | |
| Model Checking Linear Properties of Prefix-Recognizable Systems | p. 371 |
| Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking | p. 386 |
| On Discrete Modeling and Model Checking for Nonlinear Analog Systems | p. 401 |
| Compositional/Structural Verification | |
| Synchronous and Bidirectional Component Interfaces | p. 414 |
| Interface Compatibility Checking for Software Modules | p. 428 |
| Practical Methods for Proving Program Termination | p. 442 |
| Extended Model Checking | |
| Evidence-Based Model Checking | p. 455 |
| Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification | p. 471 |
| Vacuum Cleaning CTL Formulae | p. 485 |
| Tool Presentations | |
| CVC: A Cooperating Validity Checker | p. 500 |
| Chek: A Multi-valued Model-Checker | p. 505 |
| PathFinder: A Tool for Design Exploration | p. 510 |
| Abstracting C with abC | p. 515 |
| AMC: An Adaptive Model Checker | p. 521 |
| Code Verification | |
| Temporal-Safety Proofs for Systems Code | p. 526 |
| Regular Model Checking and Acceleration | |
| Extrapolating Tree Transformations | p. 539 |
| Regular Tree Model Checking | p. 555 |
| Compressing Transitions for Model Checking | p. 569 |
| Model Reduction | |
| Canonical Prefixes of Petri Net Unfoldings | p. 582 |
| State Space Reduction by Proving Confluence | p. 596 |
| Fair Simulation Minimization | p. 610 |
| Author Index | p. 625 |
| Table of Contents provided by Publisher. All Rights Reserved. |