Using SAT for combinational equivalence checking
- 13 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Combinational equivalence checking using satisfiability and recursive learningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Functional comparison of logic designs for VLSI circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Sequential circuit design using synthesis and optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Verification of large synthesized designsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- GRASP-A new search algorithm for satisfiabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Equivalence checking using cuts and heapsPublished by Association for Computing Machinery (ACM) ,1997
- Reasoning in Boolean NetworksPublished by Springer Nature ,1997
- A SAT-based implication engine for efficient ATPG, equivalence checking, and optimization of netlistsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- An efficient equivalence checker for combinational circuitsPublished by Association for Computing Machinery (ACM) ,1996
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986