Formal Verification Techniques Based on Boolean Satisfiability Problem

This paper exploits Boolean satisfiability problem in equivalence checking and model checking respectively. A combinational equivalence checking method based on incremental satisfiability is presented. This method chooses the candidate equivalent pairs with some new techniques, and uses incremental satisfiability algorithm to improve its performance. By substituting the internal equivalent pairs and converting the equivalence relations into conjunctive normal form (CNF) formulas, this approach can avoid the false negatives, and reduce the search space of SAT procedure. Experimental results on ISCAS’85 benchmark circuits show that, the presented approach is faster and more robust than those existed in literature. This paper also presents an algorithm for extracting of unsatisfiable core, which has an important application in abstraction and refinement for model checking to alleviate the state space explosion bottleneck. The error of approximate extraction is analyzed by means of simulation. An analysis reveals that an interesting phenomenon occurs, with the increasing density of the formula, the average error of the extraction is decreasing. An exact extraction approach for MU subformula, referred to as pre-assignment algorithm, is proposed. Both theoretical analysis and experimental results show that it is more efficient.

[1]  Masahiro Fujita,et al.  Efficient Combinational Verification Using Overlapping Local BDDs and a Hash Table , 2002, Formal Methods Syst. Des..

[2]  Antonio Sassano,et al.  Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae , 2001, Electron. Notes Discret. Math..

[3]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002 .

[4]  J.R. Burch,et al.  Robust latch mapping for combinational equivalence checking , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[5]  D. Brand.  Verification of large synthesized designs , 1993, ICCAD 1993.

[6]  Zijiang Yang,et al.  Iterative Abstraction using SAT-based BMC with Proof Analysis , 2003, ICCAD 2003.

[7]  Stefan Szeider,et al.  Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference , 2002, Theor. Comput. Sci..

[8]  Sharad Malik,et al.  Conflict driven learning in a quantified Boolean Satisfiability solver , 2002, ICCAD 2002.

[9]  Andreas Kuehlmann,et al.  Equivalence checking combining a structural SAT-solver, BDDs, and simulation , 2000, Proceedings 2000 International Conference on Computer Design.

[10]  Robert F. Damiano,et al.  A practical and efficient method for compare-point matching , 2002, DAC '02.

[11]  Joao Marques-Silva,et al.  Combinational equivalence checking using satisfiability and recursive learning , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[12]  Michael Burns,et al.  An Efficient Logic Equivalence Checker for Industrial Circuits , 2000, J. Electron. Test..

[13]  J.R. Burch,et al.  Tight integration of combinational verification methods , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[14]  Renato Bruni,et al.  Approximating minimal unsatisfiable subformulae by means of adaptive core search , 2003, Discret. Appl. Math..

[15]  Malay K. Ganai,et al.  Robust Boolean reasoning for equivalence checking and functional property verification , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  Helmut Veith,et al.  Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis , 2002, FMCAD.

[17]  Hans Kleine Büning,et al.  On subclasses of minimal unsatisfiable formulas , 2000, Discret. Appl. Math..

[18]  Yusuke Matsunaga.  An efficient equivalence checker for combinational circuits , 1996, DAC '96.

[19]  Thomas Stützle,et al.  SATLIB: An Online Resource for Research on SAT , 2000 .

[20]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[21]  Renato Bruni,et al.  On exact selection of minimally unsatisfiable subformulae , 2005, Annals of Mathematics and Artificial Intelligence.

[22]  Robert K. Brayton,et al.  Using SAT for combinational equivalence checking , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

[23]  Shi-Yu Huang,et al.  Formal Equivalence Checking and Design Debugging , 1998 .

[24]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[25]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.