Indexed BDDs: algorithmic advances in techniques to represent and verify Boolean functions
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 46 (11) , 1230-1245
- https://doi.org/10.1109/12.644298
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- IBDDs: an efficient functional representation for digital circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Extended BDD's: trading off canonicity for structure in verification algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Boolean satisfiability and equivalence checking using general binary decision diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Hybrid decision diagrams. Overcoming the limitations of MTBDDs and BMDsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the computational power of binary decision diagram with redundant variablesFormal Methods in System Design, 1996
- Spectral transforms for large boolean functions with applications to technology mappingPublished by Association for Computing Machinery (ACM) ,1993
- Probabilistic verification of Boolean functionsFormal Methods in System Design, 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
- The complexity of equivalence and containment for free single variable program schemesPublished by Springer Nature ,1978