Chao Wang
ABSTRACT
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which checks for the existence of counter-examples of a bounded length. The performance of SAT search depends heavily on the variable decision ordering. We propose an algorithm to exploit the correlation among different SAT problems in BMC, by predicting and successively refining a partial variable ordering. This ordering is based on the analysis of all previous unsatisfiable instances, and is combined with the SAT solver's existing decision heuristic to determine the final variable decision ordering. Experiments on real designs from industry show that our new method improves the performance of SAT-based BMC significantly.
- A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Fifth International Conference on Tools and Algorithms for Construction and Analysis of Systems, pages 193--207, Mar. 1999. LNCS 1579.]] Google Scholar
Digital Library
- R. K. Brayton et al. VIS: A system for verification and synthesis. In Eighth Conference on Computer Aided Verification, pages 428--432. July 1996. LNCS 1102.]] Google ScholarDigital Library
- P. Chauhan, E. Clarke, J. Kukula, S. Sapra, H. Veith, and D. Wang. Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis. In Formal Methods in Computer Aided Design, pages 33--51. Nov. 2002. LNCS 2517.]] Google ScholarDigital Library
- M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394--397, 1962.]] Google ScholarDigital Library
- N. Een and N. Sorensson. Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science, 89(4), 2003. First International Workshop on Bounded Model Checking.]]Google Scholar
- M. K. Ganai, P. Ashar, A. Gupta, L. Zhang, and S. Malik. Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver. In Proceedings of the Design Automation Conference, pages 747--750, June 2002.]] Google ScholarDigital Library
- E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Design, Automation and Test in Europe (DATE'02), pages 142--149, Mar. 2002.]] Google ScholarDigital Library
- E. Goldberg and Y. Novikov. Verification of proofs of unsatisfiability for CNF formulas. In Design, Automation and Test in Europe (DATE'03), pages 886--891, Munich, Germany, Mar. 2003.]] Google ScholarDigital Library
- A. Gupta, M. Ganai, C. Wang, Z. Yang, and P. Ashar. Learning from BDDs in SAT-based bounded model checking. In Proceedings of the Design Automation Conference, pages 824--829, June 2003.]] Google ScholarDigital Library
- IBM Formal Verification Benchmarks. URL: http://www.haifa.il.ibm.com/projects/verification/RB_Homepage/benchmarks.html.]]Google Scholar
- F. Lu, L. Wang, K. Cheng, J. Moondanos, and Z. Hanna. A signal correlation guided ATPG solver and its applications for solving difficult industrial cases. In Proceedings of the Design Automation Conference, pages 436--441, June 2003.]] Google ScholarDigital Library
- M. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the Design Automation Conference, pages 530--535, June 2001.]] Google ScholarDigital Library
- O. Shtrichman. Tuning sat checkers for bounded model checking. In Twelfth Conference on Computer Aided Verification . July 2000. LNCS 1855.]] Google ScholarDigital Library
- J. P. M. Silva. The impact of branching heuristics in propositional satisfiability algorithms. In Proceedings of the 9th Portuguese Conference on Artificial Intelligence, Sept. 1999.]] Google ScholarDigital Library
- J. P. M. Silva and K. A. Sakallah. Grasp---a new search algorithm for satisfiability. In Proceedings of the International Conference on Computer-Aided Design, pages 220--227, Nov. 1996.]] Google ScholarDigital Library
- URL: http://vlsi.colorado.edu/vis.]]Google Scholar
- J. Whittemore, J. Kim, and K. Sakallah. SATIRE: A new incremental satisfiability engine. In Proceedings of the Design Automation Conference, pages 542--545, June 2001.]] Google ScholarDigital Library
- L. Zhang and S. Malik. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In Design, Automation and Test in Europe (DATE'03), pages 880--885, Mar. 2003.]] Google ScholarDigital Library
Index Terms
- Refining the SAT decision ordering for bounded model checking
Recommendations
Learning from BDDs in SAT-based bounded model checking
DAC '03: Proceedings of the 40th annual Design Automation ConferenceBounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding bugs in large designs. In this paper, we explore the use of learning from ...
Accelerating Bounded Model Checking of Safety Properties
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 ...
Improved bounded model checking for the universal fragment of CTL
SAT-based bounded model checking (BMC) has been introduced as a complementary technique to BDD-based symbolic model checking in recent years, and a lot of successful work has been done in this direction. The approach was first introduced by A. Biere et ...
Comments