CAV 2000
48 papers
- A Discrete Strategy Improvement Algorithm for Solving Parity Games
- A Proof-Carrying Code Architecture for Java
- Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
- An Abstraction Algorithm for the Verification of Generalized C-Slow Designs
- An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
- Are Timed Automata Updatable?
- Automatic Verification of Parameterized Cache Coherence Protocols
- Binary Reachability Analysis of Discrete Pushdown Timed Automata
- Boolean Satisfiability with Transitivity Constraints
- Bounded Model Construction for Monadic Second-Order Logics
- Building Circuits from Relations
- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
- Counterexample-Guided Abstraction Refinement
- Decision Procedures for Inductive Boolean Functions Based on Alternating Automata
- Detecting Errors Before Reaching Them
- Distributing Timed Model Checking - How the Search Order Matters
- Efficient Algorithms for Model Checking Pushdown Systems
- Efficient Büchi Automata from LTL Formulae
- Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods
- Efficient Reachability Analysis of Hierarchical Reactive Machines
- FoCs: Automatic Generation of Simulation Checkers from Formal Specifications
- Formal Verification of VLIW Microprocessors with Speculative Execution
- IF: A Validation Environment for Timed Asynchronous Systems
- Induction in Compositional Model Checking
- Integrating WS1S with PVS
- Invited Address: Applying Formal Methods to Cryptographic Protocol Analysis
- Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation
- Invited Tutorial: Verification of Infinite-State and Parameterized Systems
- Keynote Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion
- Liveness and Acceleration in Parameterized Verification
- Mechanical Verification of an Ideal Incremental ABR Conformance
- Model Checking Continuous-Time Markov Chains by Transient Analysis
- Model-Checking for Hybrid Systems by Quotienting and Constraints Solving
- On the Competeness of Compositional Reasoning
- PET: An Interactive Software Testing Tool
- Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification
- Regular Model Checking
- Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
- Syntactic Program Transformations for Automatic Abstraction
- TAPS: A First-Order Verifier for Cryptographic Protocols
- Temporal-Locig Queries
- The STATEMATE Verification Environment - Making It Real
- Tuning SAT Checkers for Bounded Model Checking
- Unfoldings of Unbounded Petri Nets
- VINAS-P: A Tool for Trace Theoretic Verification of Timed Asynchronous Circuits
- Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification
- Verifying Advanced Microarchitectures that Support Speculation and Exceptions
- XMC: A Logic-Programming-Based Verification Toolset