Optimizing the SAT Decision Ordering of Bounded Model Checking by Structural Information

This paper considers bounded model checking for extended labeled transition systems. Bounded model checking relies on a SAT solver to prove (or disprove) the existence of a counterexample with a bounded length. During the translation of a BMC problem to a SAT problem, much useful information is lost. This paper proposes an algorithm to analyze the transition system model, and then utilize the structure information hidden in the model to refine the decision ordering of variables in SAT solving. The basic idea is to guide the search process of SAT solving by the structure of the transition system. Experiments with this heuristic on real industrial designs show 5-12 times speedup over standard bounded model checking.

[1]  Gu Ming,et al.  Modeling and Validation of a Data Process Unit Control for Space Applications , 2012 .

[2]  Chao Wang,et al.  Learning from BDDs in SAT-based bounded model checking , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[3]  Ofer Strichman,et al.  Tuning SAT Checkers for Bounded Model Checking , 2000, CAV.

[4]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[5]  Joseph Sifakis,et al.  Modeling Heterogeneous Real-time Components in BIP , 2006, Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06).

[6]  Malay K. Ganai,et al.  Circuit-based Boolean reasoning , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[7]  Min Zhou,et al.  Modeling and Validation of PLC-Controlled Systems: A Case Study , 2012, 2012 Sixth International Symposium on Theoretical Aspects of Software Engineering.

[8]  Joao Marques-Silva,et al.  The Impact of Branching Heuristics in Propositional Satisfiability Algorithms , 1999, EPIA.

[9]  Masahiro Fujita,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, DAC '99.

[10]  Lakhdar Sais,et al.  Recovering and Exploiting Structural Knowledge from CNF Formulas , 2002, CP.

[11]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[12]  Chao Wang,et al.  Refining the SAT decision ordering for bounded model checking , 2004, Proceedings. 41st Design Automation Conference, 2004..

[13]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.