SATIRE: A new incremental satisfiability engine

Proceedings - Design Automation Conference

Volumn , Issue , 2001, Pages 542-545

  Whittemore, Jesse ^a   Kim, Joonyoung ^b   Sakallah, Karem ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER ARCHITECTURE; CONSTRAINT THEORY; LEARNING SYSTEMS; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

BOOLEAN SATISFIABILITY (SAT) PROBLEMS;

SEARCH ENGINES;

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

References (20)

1. An incremental branch-and-bound method for the satisfiability problem
2. Symbolic model checking using SAT procedures instead of BDDs
3. Automatic verification of finite-state concurrent systems using temporal logic
4. New ideas for solving covering problems
5. On solving covering problems
6. A machine program for theorem proving
7. Solving the incremental satisfiability problem
8. On application of incremental satisfiability to delay fault testing
9. On solving stack-based incremental satisfiability problems
10. Functional delay faults in macro-based combinational circuits
11. A tutorial on Stalmarck's proof procedure for propositional logic
12. Monitor-based formal specification of PCI
13. GRASP: A search algorithm for propositional satisfiability
14. ATPG tools for delay faults at the functional level
15. SATO: An efficient propositional prover