Efficient Verification with BDDs using Implicitly Conjoined Invariants
No abstract available.
Related papers
- Efficient Verification of Timed Automata with BDD-Like Data-Structures VMCAI 2003
- Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking TACAS 2000
- An Abstract Domain Combinator for Separately Conjoining Memory Abstractions SAS 2014
- Conjoining Specifications TOPLAS 1995
- Points-to analysis using BDDs PLDI 2003
- Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification CAV 2002
- Rabbit: A Tool for BDD-Based Verification of Real-Time Systems CAV 2003
- Higher-Level Specification and Verification with BDDs CAV 1992