Boolean manipulation with free BDD's. First experimental results
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Logic verification using binary decision diagrams in a logic synthesis environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Sequential circuit verification using symbolic model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Analysis and manipulation of Boolean functions in terms of decision graphsPublished by Springer Nature ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Synthesis for Testability: Binary Decision DiagramsPublished by Springer Nature ,1992
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Equivalence of free boolean graphs can be decided probabilistically in polynomial timeInformation Processing Letters, 1980
- Binary Decision DiagramsIEEE Transactions on Computers, 1978
- The complexity of equivalence and containment for free single variable program schemesPublished by Springer Nature ,1978