LPSAT: a unified approach to RTL satisfiability

LPSAT is an LP-based comprehensive infrastructure designed to solve the satisfiability (SAT) problem for complex RTL designs containing both word-level arithmetic operators and bit-level Boolean logic. The presented technique uses a mixed integer linear program to model the constraints corresponding to both domains of the design. Our technique renders the constraint propagation between the two domains implicit to the MILP solver thus enhancing the overall efficiency of the SAT framework. The experimental results are quite promising when compared with generic CNF-based and BDD-based SAT algorithms.

[1]  Zhihong Zeng,et al.  A BDD-based satisfiability infrastructure using the unate recursive paradigm , 2000, DATE '00.

[2]  Joao Marques-Silva,et al.  Algorithms for solving Boolean satisfiability in combinational circuits , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[3]  Kurt Keutzer,et al.  Functional vector generation for HDL models using linear programming and 3-satisfiability , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[4]  T. Larrabee.  Efficient generation of test patterns using Boolean satisfiability , 1990 .

[5]  F. Somenzi,et al.  A new algorithm for the binate covering problem and its application to the minimization of Boolean relations , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[6]  Farzan Fallah.  Coverage-directed validation of hardware models , 1999 .

[7]  Seh-Woong Jeong,et al.  A new algorithm for the binate covering problem and its application to the minimization of Boolean relations , 1992, ICCAD.

[8]  J. Freeman.  Improvements to propositional satisfiability search algorithms , 1995 .

[9]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[10]  J. K. Lowe,et al.  Some results and experiments in programming techniques for propositional logic , 1986, Comput. Oper. Res..

[11]  K. Keutzer,et al.  Functional Vector Generation for HDL Models Using , 2001 .

[12]  Tiziano Villa,et al.  Explicit and implicit algorithms for binate covering problems , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  R. Kalyanaraman,et al.  Generation of design verification tests from behavioral VHDL programs using path enumeration and constraint programming , 1995, IEEE Trans. Very Large Scale Integr. Syst..

[14]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[15]  Bill Lin,et al.  Minimization of symbolic relations , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[16]  A. K. Chandra,et al.  Constraint solving for test case generation: a technique for high-level design verification , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[17]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.

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

[19]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[20]  Robert K. Brayton,et al.  Combinational test generation using satisfiability , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  Hantao Zhang,et al.  SATO: An Efficient Propositional Prover , 1997, CADE.

[22]  David A. McAllester,et al.  A Rearrangement Search Strategy for Determining Propositional Satisfiability , 1988, AAAI.

[23]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.