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 k. The BMC problem can be efficiently reduced to a propositional satisfiability problem, and can therefore be solved by SAT methods rather than BDDs. SAT procedures are based on general-purpose heuristics that are designed for any propositional formula. We show how the unique characteristics of BMC invariant formulas (G p) can be exploited for a variety of optimizations in the SAT checking procedure. Experiments with these optimizations on real designs prove their efficiency in many of the hard test cases, in comparison to both the standard SAT procedure and a BDD-based model checker.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Baker, “Intelligent backtracking on constraint satisfaction problems: Experimental and theoretical results,” PhD thesis, Univ. of Oregon, 1995.
I. Beer, S. Ben-David, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, and Y. Wolfsthal, “RuleBase: Model checking at IBM,” in Orna Grumberg (Ed.), Proc. 9th Intl. Conference on Computer Aided Verification (CAV'97), Vol. 1254 of Lect. Notes in Comp. Sci., Springer-Verlag, 1997, pp. 480-483.
I. Beer, S. Ben-David, C. Eisner, and A. Landver, “RuleBase: An industry oriented formal verification tool,” in Proc. Design Automation Conference 96 (DAC'96), 1996.
I. Beer, S. Ben-David, and A. Landver, “On-the-fly model checking of RCTL formulas,” in A.J. Hu and M.Y. Vardi (Eds.), Proc. 10th Intl. Conference on Computer Aided Verification (CAV'98), Vol. 1427 of Lect. Notes in Comp. Sci., Springer-Verlag, 1998, pp. 184-194.
A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, “Symbolic model checking without BDDs,” in Proc. of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), LNCS, Springer-Verlag, 1999, pp. 193-207.
A. Biere, E. Clarke, R. Raimi, and Y. Zhu, “Verifying safety properties of a PowerPCTM microprocessor using symbolic model checking without bdds,” in N. Halbwachs and D. Peled (Eds.), Proc. 11th Intl. Conference on Computer Aided Verification (CAV'99), Lect. Notes in Comp. Sci., Springer-Verlag, 1999.
W. Chan, R. Anderson, P. Beame, and D. Notkin, “Improving efficiency of symbolic model checking for state-based system requirements,” in International Symposium on Software Testing and Analysis (ISSTA'98), Lect. Notes in Comp. Sci., Springer-Verlag, 1998.
M. Davis and H. Putnam, “A computing procedure for quantification theory,” J. ACM, Vol. 7, pp. 201-215, 1960.
H. Iwashita, T. Nakata, and F. Hirose, “Ctl model checking based on forward state traversal,” in IEEE/ACM International Conference on Computer Aided Design, Nov. 1996, pp. 82-87.
M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, “Chaff: Engineering an efficient SAT solver,” in Proc. Design Automation Conference 2001 (DAC'01), 2001.
O. Shacham and E. Zarpas, “Tuning the VSIDS decision heuristic for bounded model checking,” in Microprocessor Test and Verification (MTV'03), 2003.
O. Shtrichman, “Tuning SAT checkers for bounded model checking,” in E.A. Emerson and A.P. Sistla (Eds.), Proc. 12th Intl. Conference on Computer Aided Verification (CAV'00), Lect. Notes in Comp. Sci., Springer-Verlag, 2000.
O. Shtrichman, “Prunning techniques for the SAT-based bounded model checking problem,” in Proceedings of the 11th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'01), Edinburgh, Sept. 2001.
J.P.M. Silva, “The impact of branching heuristics in propositional satisfiability algorithms,” in 9th Portuguese Conference on Artificial Intelligence (EPIA), 1999.
J.P.M. Silva and K.A. Sakallah, “GRASP-A new search algorithm for satisfiability,” Technical Report TRCSE-292996, University of Michigen, 1996.
J.P.M. Silva and K.A Sakallah, “Robust search algorithms for test pattern generation,” in Proc. of the IEEE Fault-Tolerant Computing Symposium, June 1997.
J.P.M. Silva and K.A. Sakallah, “GRASP: A search algorithm for propositional satisfiability,” IEEE Transactions on Computers, Vol. 48, pp. 506-516, 1999.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Strichman, O. Accelerating Bounded Model Checking of Safety Properties. Formal Methods in System Design 24, 5–24 (2004). https://doi.org/10.1023/B:FORM.0000004785.67232.f8
Issue Date:
DOI: https://doi.org/10.1023/B:FORM.0000004785.67232.f8