BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems
No abstract available.
Related papers
- Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking TACAS 2000
- Optimizing Symbolic Model Checking for Constraint-Rich Models CAV 1999
- Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results TOPLAS 1999
- Applying the concurrent collections programming model to asynchronous parallel dense linear algebra PPoPP 2010
- Bounded Model Checking for Asynchronous Hyperproperties TACAS 2023
- A Temporal Logic for Asynchronous Hyperproperties CAV 2021
- Hitting Families of Schedules for Asynchronous Programs CAV 2016
- Symbolic Model Checking without BDDs TACAS 1999