Bounded Model Checking Using Satisfiability Solving (2001)
Cached
Download Links
- [www.aladdin.cs.cmu.edu]
- [fmv.jku.at]
- [www.cs.cmu.edu]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | Formal Methods in System Design |
| Citations: | 103 - 1 self |
BibTeX
@INPROCEEDINGS{Clarke01boundedmodel,
author = {Edmund Clarke and Armin Biere and Richard Raimi and Yunshan Zhu},
title = {Bounded Model Checking Using Satisfiability Solving},
booktitle = {Formal Methods in System Design},
year = {2001},
pages = {2001},
publisher = {Kluwer Academic Publishers}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The phrase model checking refers to algorithms for exploring the state space of a transition system to determine if it obeys a specification of its intended behavior. These algorithms can perform exhaustive verification in a highly automatic manner, and, thus, have attracted much interest in industry. Model checking programs are now being commercially marketed. However, model checking has been held back by the state explosion problem, which is the problem that the number of states in a system grows exponentially in the number of system components. Much research has been devoted to ameliorating this problem.
