Indexed BDDs: Algorithmic advances in techniques to represent and verify Boolean functions

IEEE Transactions on Computers

Volumn 46, Issue 11, 1997, Pages 1230-1245

  Jain, Jawahar ^a,b   Bitner, James ^c   Abadir, Magdy S ^a,d   Abraham, Jacob A ^a,c   Fussell, Donald S ^c  

^a IEEE   (United States)

^b FUJITSU LABORATORIES OF AMERICA   (United States)

^c The University of Texas at Austin   (United States)

^d MOTOROLA INC   (United States)

Author keywords

BDDs; Boolean functions; Canonical representations; Free BDDs; Graph representations; IBDDs; OBDDs; Satisfiability; Verification

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; DECISION THEORY;

BINARY DECISION DIAGRAMS (BDD); CANONICAL REPRESENTATIONS; GRAPH REPRESENTATIONS;

BOOLEAN FUNCTIONS;

EID: 0031348809     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.644298     Document Type: Article

References (18)

1. P. Ashar, A. Ghosh, and S. Devadas, "Boolean Satisfiability and Equivalence Checking Using General Binary Decision Diagrams," Proc. Int'l Conf. Computer Design, pp. 259-264, 1991.
2. J. Bitner, J. Jain, M. Abadir, J.A. Abraham, and D.S. Fussell, "Efficient Verification of Multiplier and Other Difficult Functions Using IBDDs," Proc. Custom Integrated Circuits Conf., pp. 5.5.1-5.5.5, 1992.
3. J. Bitner, J. Jain, D.S. Fussell, J.A. Abraham, and M. Abadir, "Using Indexed BDDs in Specifying and Verifying Complex Circuits," Proc. IFIP Workshop Architecture and Logic Synthesis, 1993.
4. B. Bollig, M. Sauerhoff, D. Sieling, and I. Wegener, "Read k Times Ordered Binary Decision Diagrams - Efficient Algorithms in Presence of Null Chains," Technical Report 474, Univ. of Dortmund, 1993.
5. R.E. Bryant, "Graph Based Algorithms for Boolean Function Representation," IEEE Trans. Computers, vol. 35, no. 8, pp. 677-690, Aug. 1986.
6. R.E. Bryant, "On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication," IEEE Trans. Computers, vol. 40, no. 2, pp. 206-213, Feb. 1991.
7. R.E. Bryant, and Y. Chen, "Verification of Arithmetic Functions with Binary Moment Diagrams," Proc. 32nd Design Automation Conf., pp. 535-541, 1995.
8. J.R. Burch, "Multiplier Verification Using BDDs," Proc. 28th Design Automation Conf., pp. 408-412, 1991.
9. E.M. Clarke, K.L. McMillan, X. Zhao, M. Fujita, and J. Yang, "Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping," Proc. 30th Design Automation Conf., pp. 54-60, 1993.
10. E.M. Clarke, M. Fujita, and X. Zhao, "Hybrid Decision Diagrams Overcoming the Limitations of MTBDDs and BMDs," Proc. Int'l Conf. Computer-Aided Design, pp. 159-163, 1995.
11. L. Fortune, J. Hopcroft, and E.-M. Schmidt, "The Complexity of Equivalence and Containment for Free Single Variable Program Schemes," Goos, Hartmanis, Ausiello, and Bohm, eds., Lecture Notes in Computer Science 62, pp. 227-240. Springer-Verlag, 1978.
12. S.J. Friedman, "Efficient Data Structures for Boolean Function Representation," PhD dissertation, Computer Science Dept., Princeton Univ., 1990.
13. K. Hwang. Computer Arithmetic: Principles, Architectures & Design. John Wiley & Sons, 1979.
14. J. Jain, M. Abadir, J. Bitner, D.S. Fussell, and J.A. Abraham, "IBDDs: An Efficient Functional Representation for Digital Circuits," Proc. European Design Automation Conf., 1992.
15. J. Jain, J. Bitner, D.S. Fussell, and J.A. Abraham, "Functional Partitioning for Verification and Related Problems," Proc. Brown/MIT VLSI Conf., pp. 210-226, 1992.
16. J. Jain, J. Bitner, D.S. Fussell, and J.A. Abraham, "Probabilistic Verification of Boolean Functions," Formal Methods in System Design, vol. 1, pp. 61-115, July 1992.
17. S.-W. Jsong, B. Plessier, G. Hachtel, and F. Somenzi, "Stuctural BDDs: Trading Canonicity for Structure in Verification Algorithms," Proc. Int'l Conf. Computer-Aided Design, pp. 464-467, 1991.
18. T. Yamada and H. Yasuura, "On the Computational Power of Binary Decision Diagrams with Redundant Variables," Formal Methods in System Design, vol. 8, pp. 65-89, Jan. 1996.