DMCA
BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems (2000)
| Venue: | In Proc. TACAS 2000, LNCS 1785 |
| Citations: | 8 - 0 self |
BibTeX
@INPROCEEDINGS{Bultan00bddvs.,
author = {Tevfik Bultan},
title = {BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems},
booktitle = {In Proc. TACAS 2000, LNCS 1785},
year = {2000},
pages = {441--455},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
BDD-based symbolic model checking has been successful in verification of a wide range of systems. Recently, constraint-based approaches, which use arithmetic constraints as a symbolic representation, have been used in symbolic model checking of infinite-state systems. We argue that use of constraint-based model checking is not limited to infinite-state systems. It can also be used as an alternative to BDDbased model checking for systems with integer variables which have finite but large domains. In this paper we investigate the trade-offs between these two approaches experimentally. We compare the performance of BDD-based model checker SMV to the performance of our constraintbased model checker on verification of several asynchronous concurrent systems. The results indicate that constraint-based model checking is a viable option for verification of asynchronous concurrent systems with large integer domains.
Keyphrases
constraint-based model checking asynchronous concurrent system bdd v experimental evaluation infinite-state system bdd-based symbolic model checking bdd-based model checker smv symbolic representation viable option several asynchronous concurrent system constraint-based approach constraintbased model checker symbolic model checking large domain wide range arithmetic constraint large integer domain integer variable
