![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Strichman Ofer
Publisher: Springer Publishing Company
ISSN: 0925-9856
Source: Formal Methods in System Design, Vol.24, Iss.1, 2004-01, pp. : 5-24
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search for a counterexample in executions whose length is bounded by some integer
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Model checking with bounded context switching
Formal Aspects of Computing, Vol. 23, Iss. 3, 2011-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Angeletti Damiano Giunchiglia Enrico Narizzano Massimo Puddu Alessandra Sabina Salvatore
Journal of Automated Reasoning, Vol. 45, Iss. 4, 2010-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Bounded model checking of infinite state systems
By Schuele Tobias Schneider Klaus
Formal Methods in System Design, Vol. 30, Iss. 1, 2007-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)