Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver

Proceedings - Design Automation Conference

Volumn , Issue , 2002, Pages 747-750

  Ganai, Malay K ^a   Zhang, Lintao ^b   Ashar, Pranav ^a   Gupta, Aarti ^a   Malik, Sharad ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Boolean constraint propagation (BCP); Boolean satisfiability (SAT); Bounded model checking (BMC); Conjunctive normal form (CNF)

Indexed keywords

AUTOMATIC TEST PATTERN GENERATION (ATPG); BOOLEAN CONSTRAINT PROPAGATION (BCP);

ALGORITHMS; AUTOMATIC TESTING; BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; HEURISTIC METHODS; PROBLEM SOLVING;

VLSI CIRCUITS;

EID: 0036045483     PISSN: 0738100X     EISSN: None     Source Type: Journal    
DOI: 10.1109/DAC.2002.1012722     Document Type: Article

References (10)

1. Chaff: Engineering an efficient SAT solver
2. SATO: An efficient propositional prover
3. GRASP: A search algorithm for propositional satisfiability
4. SOCRATES: A highly efficient ATPG system
5. Circuit-based boolean reasoning
6. Symbolic model checking without BDDs
7. On the acceleration of test generation algorithms
8. An implicit enumeration algorithm to generate tests for Combinational circuits
9. A machine program for theorem proving