Accelerating boolean satisfiability through application specific processing

Proceedings of the International Symposium on System Synthesis

Volumn , Issue , 2001, Pages 244-249

  Zhao, Ying ^a   Malik, Sharad ^a   Moskewicz, Matthew ^b   Madigan, Conor ^c  

^a Princeton University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Application specific; Boolean satisfiability; Configurable processor core; Multiprocessor

Indexed keywords

ALGORITHMS; APPLICATION SPECIFIC INTEGRATED CIRCUITS; BOOLEAN ALGEBRA; COMPUTER SIMULATION;

CONFIGURABLE PROCESSOR CORES;

MULTIPROCESSING SYSTEMS;

EID: 0034790791     PISSN: 10801820     EISSN: None     Source Type: Journal    
DOI: 10.1145/500001.500059     Document Type: Article

References (15)

1. Combinational test generation using satisfiability
2. Optimal layout via boolean satisfiability
3. A computing procedure for quantification theory
4. GRASP- A new search algorithm for satisfiability
5. SATO: An efficient propositional prover
6. Engineering a (Super?) efficient SAT solver
7. Satisfiability on reconfigurable hardware
8. Solving boolean satisfiabiligy with dynamic hardware configuration
9. Multiprocessing of combinational search problems
10. Parallel heuristic search: Two approaches
11. Matching architecture to application via configurable processors: A case study with Boolean satisfiability