A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
SAT-based unbounded symbolic model checking
2005
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
1 This paper describes a SAT-based unbounded symbolic model checking algorithm. BDDs have been widely used for symbolic model checking, but the approach suffers from memory overflow. The SAT procedure was exploited to overcome the problem, but it verified only the states reachable through a bounded number of transitions. The proposed algorithm deals with unbounded symbolic model checking. The conjunctive normal form is used to represent sets of states and the transition relation, and a SAT
doi:10.1109/tcad.2004.841068
fatcat:jbdrilx27re7fm6jd4fnd2a6b4