Construction of Efficient BDDs for Bounded Arithmetic Constraints
No abstract available.
DOI 10.1007/3-540-36577-x_28
Related papers
- Symboloc Model Checking for Event-Driven Real-Time Systems TOPLAS 1997
- Clausal Proofs for Pseudo-Boolean Reasoning TACAS 2022
- Symbolic Model Checking without BDDs TACAS 1999
- On the Construction of Automata from Linear Arithmetic Constraints TACAS 2000
- Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking TACAS 2000
- BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems TACAS 2000
- Flat Model Checking for Counting LTL Using Quantifier-Free Presburger Arithmetic VMCAI 2019
- The countdown problem JFP 2002