Faster SAT and smaller BDDS via common function structure

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2001, Pages 443-448

  Aloul, F A ^a   Markov, I L ^a   Sakallah, K A ^a  

^a University of Michigan   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CODES (SYMBOLS); DECISION THEORY; HEURISTIC METHODS;

BINARY DECISION DIAGRAMS (BDD);

COMPUTER AIDED DESIGN;

EID: 0035209101     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Circuit width, register allocation, and ordered binary decision diagrams
2. Symbolic model checking using SAT procedures instead of BDDs
3. Combinational problems of sequential benchmark circuits
4. Graph-based algorithms for Boolean function manipulation
5. Can recursive bisection produce routable placements?
6. Improved algorithms for hypergraph bipartitioning
7. Evaluation and improvements of boolean comparison method based on binary decision diagrams
8. Boosting combinatorial search through randomization
9. Relaxation and clustering in a local search framework: Application to linear placement
10. Design of a pointerless BDD package
11. Multilevel hypergraph partitioning: Applications in VLSI design
12. Test pattern generation using boolean satisfiability
13. BDD variable ordering using window-based sampling
14. Logic verification using binary decision diagrams in a logic synthesis environment
15. Chaff: Engineering an efficient SAT solver
16. A comparative study of two boolean formulations of FPGA detailed routing constraints
17. Who are the variables in your neighborhood
18. Why is ATPG easy?
19. Dynamic variable ordering for ordered binary decision diagrams
20. GRASP-A new search algorithm for satisfiability
21. Timing analysis using propositional satisfiability
22. Combinational test generation using satisfiability
23. FPGA routing and routability estimation via boolean satisfiability
24. SATO: An efficient propositional prover