Skip to main content

A brief study of BDD package performance

  • Conference paper
  • First Online:
Formal Methods in Computer-Aided Design (FMCAD 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1166))

Included in the following conference series:

Abstract

The use of BDD techniques has become essential in a variety of CAD problems, and particularly in employing formal methods for design and verification. There are now many BDD packages available with many different features. Given a particular application, it is difficult to choose which package is best-suited for solving the problem, despite extensive published results on the packages. This paper contains a study of a few state-of-the art BDD packages. Results comparing the packages are reported on a variety of examples, for a variety of applications, and on several computing platforms. Great care has been taken to make fair and meaningful comparisons. The study is offered to compare current available BDD technology, and to encourage BDD package authors to use this experimental foundation and to make their results and code available to the research community.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Berry and G. Gonthier. The Esterel Synchronous Programming Language: Design, Semantics, Implementation. Science of Comp. Prog., 19(2):87–152, 1992.

    Google Scholar 

  2. K. Brace, R. Rudell, and R. Bryant. Efficient Implementation of a BDD Package. In 27th DAC, pages 40–45, June 1990.

    Google Scholar 

  3. R.E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.

    Google Scholar 

  4. R.E. Bryant. Symbolic Boolean Manipulation with Ordered Binary-Decision Dia-grams. ACM Computing Surveys, 24(3):293–318, September 1992.

    Google Scholar 

  5. R.E. Bryant. Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification. In ICCAD, pages 236–243, November 1995.

    Google Scholar 

  6. R.E. Bryant and Y.-A. Chen. Verification of Arithmetic Circuits with Binary Moment Diagrams. In Proceedings of the 32nd Design Automation Conference, pages 535–541, June 1995.

    Google Scholar 

  7. M. Chiodo, P. Giusto, H. Hsieh, A. Jurecska, L. Lavagno, and A. Sangiovanni-Vincentelli. A Formal Specification Model for Hardware/Software Codesign, June 1993. UC Berkeley Technical REport UCB/ERL M93/48.

    Google Scholar 

  8. O. Coudert, J.-C. Madre, and H. Touati, December 1993. TiGeR Version 1.0 User Guide, Digital Paris Research Lab.

    Google Scholar 

  9. M. Fujita, H. Fujisawa, and N. Kawato. Evaluation and Improvements of Boolean Comparison Method Based on Binary Decision Diagrams. In ICCAD, pages 2–5, November 1988.

    Google Scholar 

  10. A. Hett, R. Drechsler, and B. Becker. MORE: Alternative Implementation of BDD-Packages by Multi-Operand Synthesis. In Proc of EuroDAC, 1996. To appear.

    Google Scholar 

  11. N. Klarlund and T. Rauhe. BDD algorithms and cache misses, January 1996. Unpublished manuscript.

    Google Scholar 

  12. David Long, November 1993. Personal communication.

    Google Scholar 

  13. David Long, April 1996. Personal communication.

    Google Scholar 

  14. S. Malik, A.R. Wang, R.K. Brayton, and A. Sangiovanni-Vincentelli. Logic Verification using Binary Decision Diagrams in a Logic Synthesis Environment. In ICCAD, pages 6–9, November 1988.

    Google Scholar 

  15. S. Manne, D. C. Grunwald, and F. Somenzi. Remembrance of Things Past: Locality and Memory in BDDs, April 1996. Unpublished manuscript.

    Google Scholar 

  16. P.C. McGeer, K.L. McMillan, A. Saldanha, A.L. Sangiovanni-Vincentelli, and P. Scaglia. Fast Discrete Function Evaluation using Decision Diagrams. In ICCAD, pages 402–407, November 1995.

    Google Scholar 

  17. M.R. Mercer, R. Kapur, and D.E. Ross. Functional Approaches to Generating Orderings for Efficient Symbolic Rep. In 29th DAC, pages 624–627, June 1992.

    Google Scholar 

  18. H. Ochi, N. Ishiura, and S. Yajima. Breadth-First Manipulation of SBDD of Boolean Functions for Vector Processing. In 28th DAC, pages 413–416, June 1991.

    Google Scholar 

  19. S. Panda, F. Somenzi, and B.F. Plessier. Symmetry Detection and Dynamic Variable Ordering of Decision Diagrams. In ICCAD, pages 628–631, November 1994.

    Google Scholar 

  20. R.K. Ranjan, J.V. Sanghavi, R.K. Brayton, and A. Sangiovanni-Vincentelli. High Performance BDD Package Based on Exploiting Memory Hierarchy, June 1996.

    Google Scholar 

  21. R. Rudell. Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In ICCAD, pages 42–47, November 1993.

    Google Scholar 

  22. E.M. Sentovich, K.J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P.R. Stephan, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. SIS: A System for Sequential Circuit Synthesis, May 1992. UC Berkeley Technical Report UCB/ERL M92/41.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mandayam Srivas Albert Camilleri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sentovich, E.M. (1996). A brief study of BDD package performance. In: Srivas, M., Camilleri, A. (eds) Formal Methods in Computer-Aided Design. FMCAD 1996. Lecture Notes in Computer Science, vol 1166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031823

Download citation

  • DOI: https://doi.org/10.1007/BFb0031823

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61937-6

  • Online ISBN: 978-3-540-49567-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics