Faster SAT and smaller BDDs via common function structure
Authors:
- F.A. AloulFAF.A. Aloul
- I.L. MarkovIMI.L. Markov
- K.A. SakallahKSK.A. Sakallah
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 443-448
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Combinational profiles of sequential benchmark circuits2003
- Logic verification using binary decision diagrams in a logic synthesis environment2003
- Evaluation and improvement of Boolean comparison method based on binary decision diagrams2003
- A comparative study of two Boolean formulations of FPGA detailed routing constraints2001
- Can recursive bisection alone produce routable placements?2000
- Relaxation and clustering in a local search framework1999
- FPGA routing and routability estimation via Boolean satisfiabilityIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1998
- Combinational test generation using satisfiabilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996
- Test pattern generation using Boolean satisfiabilityIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986