Download:
by Zhihong Zeng, Priyank Kalla, Maciej Ciesielski
In Proc. DATE
http://www.sigda.org/Archives/ProceedingArchives/Date/Date2001/papers/2001/date01/htmfiles/sun_sgi/../../pdffiles/06c_1.pdf
Add To MetaCart
Abstract:
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. I.
Citations
|
778
|
A computing procedure for quantification theory
– Davis, Putnam
- 1960
|
|
301
|
Graph based algorithms for Boolean function representation
– Bryant
- 1986
|
|
208
|
GRASP - A New Search Algorithm for Satisfiability
– Marques-Silva, Sakallah
- 1996
|
|
145
|
SATO: an efficient propositional prover
– Zhang
- 1997
|
|
130
|
Improvements to propositional satisfiability search algorithms
– Freeman
- 1995
|
|
86
|
Combinational test generation using satisfiability
– Stephan, Brayton, et al.
- 1996
|
|
85
|
VIS: a system for verification and synthesis
– Brayton, Hachtel, et al.
- 1996
|
|
61
|
A rearrangement search strategy for determining propositional satisfiability
– Zabih, McAllester
- 1988
|
|
51
|
Some Results and Experiments in Programming Techniques for Propositional Logic
– Blair, Jeroslow, et al.
- 1986
|
|
26
|
Functional Vector Generation for HDL Models Using Linear Programming and
– Fallah, Devadas, et al.
- 1998
|
|
23
|
Generation of design verification tests from behavioral vhdl programs using path enumeration and constraint programming
– Vemuri, Kalyanaraman
- 1995
|
|
18
|
A new algorithm for the binate covering problem and its application to the minimization of Boolean relations
– Jeong, Somenzi
- 1992
|
|
17
|
Explicit and Implicit Algorithms for Binate Covering Problems
– Villa, Kam, et al.
- 1997
|
|
12
|
Constraint solving for test case generation – a technique of high level design verification
– Chandra, Iyengar
- 1992
|
|
9
|
A BDD-based Satisfiability Infrastructure using the Unate Recursive Paradigm
– Kalla, Zeng, et al.
- 2000
|
|
8
|
Algorithms for Solving Boolean Satisfiability
– Silva, Silvera, et al.
- 1999
|
|
4
|
Coverage Directed Validation of Hardware Models
– Fallah
- 1999
|
|
3
|
Efficient Generation of Test Patterns using Satisfiability
– Larabee
- 1990
|
