Indexed BDDs: algorithmic advances in techniques to represent and verify Boolean functions
Authors:
- J. JainJJJ. Jain
- J. BitnerJBJ. Bitner
- M.S. AbadirMAM.S. Abadir
- J.A. AbrahamJAJ.A. Abraham
- D.S. FussellDFD.S. Fussell
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 46 (11) , 1230-1245
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- On the computational power of binary decision diagram with redundant variablesFormal Methods in System Design, 1996
- Verification of Arithmetic Circuits with Binary Moment DiagramsProceedings of the 39th conference on Design automation - DAC '02, 1995
- Spectral transforms for large boolean functions with applications to technology mapping1993
- Probabilistic verification of Boolean functionsFormal Methods in System Design, 1992
- Efficient Verification Of Multiplier And Other Difficult Functions Using IBDDs1992
- 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 schemes1978