CAV 2002
51 papers
- A Modular Checker for Multithreaded Programs
- AMC: An Adaptive Model Checker
- Abstracting C with abC
- Algorithmic Verification of Invalidation-Based Protocols
- Applying SAT Methods in Unbounded Symbolic Model Checking
- Automated Unbounded Verification of Security Protocols
- Automatic Abstraction Using Generalized Model Checking
- Automatic Derivation of Timing Constraints by Failure Analysis
- CVC: A Cooperating Validity Checker
- Canonical Prefixes of Petri Net Unfoldings
- Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
- Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking
- Compressing Transitions for Model Checking
- Conformance Checking for Models of Asynchronous Message Passing Software
- Deciding Separation Formulas with SAT
- Evidence-Based Model Checking
- Exploiting Behavioral Hierarchy for Efficient Model Checking
- Extrapolating Tree Transformations
- Fair Simulation Minimization
- Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving
- IF-2.0: A Validation Environment for Component-Based Real-Time Systems
- Infinite Games and Verification (Extended Abstract of a Tutorial)
- Interface Compatibility Checking for Software Modules
- Liveness with (0, 1, infty)-Counter Abstraction
- Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification
- Model Checking Linear Properties of Prefix-Recognizable Systems
- Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions
- NuSMV 2: An OpenSource Tool for Symbolic Model Checking
- On Abstraction in Software Verification
- On Discrete Modeling and Model Checking for Nonlinear Analog Systems
- PathFinder: A Tool for Design Exploration
- Practical Methods for Proving Program Termination
- Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
- Property Checking via Structural Analysis
- Regular Tree Model Checking
- SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques
- SPeeDI - A Verification Tool for Polygonal Hybrid Systems
- Semi-formal Bounded Model Checking
- Shared Memory Consistency Protocol Verification Against Weak Memory Models: Refinement via Model-Checking
- Software Analysis and Model Checking
- State Space Reduction by Proving Confluence
- Symbolic Localization Reduction with Reconstruction Layering and Backtracking
- Synchronous and Bidirectional Component Interfaces
- Temporal-Safety Proofs for Systems Code
- The AVISS Security Protocol Analysis Tool
- The Quest for Efficient Boolean Satisfiability Solvers
- The Symbolic Approach to Hybrid Systems
- The d/dt Tool for Verification of Hybrid Systems
- Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking
- Vacuum Cleaning CTL Formulae
- chi-Chek: A Multi-valued Model-Checker