Efficient manipulation of decision diagrams

International Journal on Software Tools for Technology Transfer

Volumn 3, Issue 2, 2001, Pages 171-181

  Somenzi, Fabio ^a  

^a UCB 450   (United States)

Author keywords

Binary decision diagrams; Strong canonical form; Variable reordering

Indexed keywords

CANONICAL FORM; DECISION DIAGRAM; DEPTH FIRST; EFFICIENT IMPLEMENTATION; ORDERED BINARY DECISION DIAGRAMS; VARIABLE REORDERING;

ALGORITHMS; BINARY DECISION DIAGRAMS;

DECISION THEORY;

EID: 84896694135     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090100042     Document Type: Article

References (42)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading, Mass., USA, 1983
2. Anderson, J., Berc, L.M., Dean, J., Ghemawat, S., Henzinger, M.R., Leung, S.-T., Sites, R.L., Vandevoorde, M.T., Wald- spurger, C.A.: Continuous profiling: where have all the cycles gone? ACM Trans. on Computer Systems, pp. 357-390, November 1997
3. Ashar, P., Cheong, M.: Efficient breadth-first manipulation of binary decision diagrams. In: Proc. Int. Conf. on Computer- Aided Design, pp. 622-627, San Jose, Calif., USA, November 1994.
4. Biere, A.: Personal communication, 1998
5. Bollig, B., Löbbing, M., Wegener, I.: On the effect of local changes in the variable ordering of ordered decision diagrams. Inf. Process. Lett. 59(5): 233-239, 1996
6. Brace, K.S., Rudell, R.L., Bryant, R.E.: Efficient implementation of a BDD package. In: Proc. 27th Design Automation Conference, pp. 40-45, Orlando, Fla., USA, June 1990
7. Brayton, R.K. et al.: VIS: A systemfor verification and synthesis. In: Henzinger, T., Alur, R. (eds.): 8th Conference on Computer Aided Verification (CAV'96). Rutgers University. LNCS 111. Berlin, Heidelberg, New York: Springer- Verlag, 1996, pp. 428-432
8. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers C-35(8): 677-691, August 1986
9. Bryant, R.E.: Personal communication, 1995
10. Coudert, O.: Personal communication, 1998
11. Coudert, O., Berthet, C., Madre, J.C.: Verification of sequential machines using boolean functional vectors. In: Claesen, L. (ed.): Proc. IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, pp. 111-128, Leuven, Belgium, November 1989
12. Drechsler, R., Günther, W.: Using lower bounds during dynamic BDD minimization. In: Proc. Design Automation Conference, pp. 29-32, New Orleans, La., USA, June 1999
13. Drechsler, R., Sieling, D.: Binary decision diagrams in theory and practice. Software Tools Technol. Transfer. This issue
14. Friedman, S.J., Supowit, K.J.: Finding the optimal variable ordering for binary decision diagrams. IEEE Trans. on Computers 39(5): 710-713, May 1990
15. Fujita, M., Matsunaga, Y., Kakuda, T.: On variable ordering of binary decision diagrams for the application of multi-level logic synthesis. In: Proc. European Conference on Design Automation, pp. 50-54, Amsterdam, February 1991
16. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. SIAM 10(1): 196-210, 1962
17. Hett, A., Drechsler, R., Becker, B.: MORE: alternative implementation of BDD-packages by multi-operand synthesis. In: Proc. European Design Automation Conference, pp. 164-169, 1996
18. Higuchi, H.: Personal communication, 1998
19. Higuchi, H., Somenzi, F.: Lazy group sifting for efficient symbolic state traversal of FSMs. In: Proc. Int. Conf. on Computer-Aided Design, pp. 45-49, San Jose, Calif., USA, November 1999
20. Hong, Y., Beerel, P.A., Burch, J.R., McMillan, K.L.: Safe BDD minimization using don't cares. In: Proc. Design Automation Conference, pp. 208-213, Anaheim, Calif., USA, June 1997
21. Kamhi, G., Fix, L.: Adaptive variable reordering for symbolic model checking. In: Proc. Int. Conf. on Computer-Aided Design, pp. 359-365, San Jose, Calif., USA, November 1998
22. Karplus, K.: Using if-then-else DAG's for multi-level minimization. In: Decennial Caltech Conference on VLSI, May 1989
23. Long, D.E.: Robdd package, 1993
24. Long, D.E.: The design of a cache-friendly BDD library. In: Proc. Int. Conf. on Computer-Aided Design, pp. 639-645, San Jose, Calif., USA, November 1998
25. Madre, J.C.: Personal communication, 1996
26. Madre, J.C., Billon, J.P.: Proving circuit correctness using formal comparison between expected and extracted behavior. In: Proc. 25th Design Automation Conference, pp. 205-210, June 1988
27. Manne, S., Grunwald, D.C., Somenzi, F.: Remembrance of things past: locality and memory in BDDs. In: Proc. Design Automation Conference, pp. 196-201, Anaheim, Calif., USA, June 1997
28. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic, Boston, Mass., USA, 1994
29. McMillan, K.L.: A conjunctively decomposed Boolean representation for symbolic model checking. In: Alur, R., Henzinger, T.A. (eds.): 8th Conference on Computer Aided Verification (CAV'96). LNCS 1102. Berlin, Heidelberg, New York: Springer-Verlag, 1996, pp. 13-25
30. Minato, S.-I., Ishiura, N., Yajima, S.: Shared binary decision diagramwith attributed edges for efficient boolean function manipulation. In: Proc. Design Automation Conference, pp. 52-57, Orlando, Fla, USA, June 1990
31. Ochi, H., Yasuoka, K., Yajima, S.: Breadth-first manipulation of very large binary-decision diagrams. In: Proc. Int. Conf. on Computer-Aided Design, pp. 48-55, Santa Clara, Calif., USA, November 1993
32. Panda, S., Somenzi, F.: Who are the variables in your neighborhood. In: Proc. Int. Conf. on Computer-Aided Design, pp. 74-77, San Jose, Calif., USA, November 1995
33. Ravi, K., McMillan, K.L., Shiple, T.R., Somenzi, F.: Approximation and decomposition of decision diagrams. In: Proc. Design Automation Conference, pp. 445-450, San Francisco, Calif., USA, June 1998
34. Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proc. Int. Conf. on Computer-Aided Design, pp. 42-47, Santa Clara, Calif., USA, November 1993
35. Rudell, R.: Personal communication, 1994
36. Sanghavi, J.V., Ranjan, R.K., Brayton, R.K., SangiovanniVincentelli, A.: High performance BDD package based on exploiting memory hierarchy. In: Proc. Design Automation Conference, pp. 635-640, Las Vegas, Nev., USA, June 1996
37. Slobodova, A., Meinel, C.: Sample method for minimization of OBDDs. In: SOFSEM'98: Theory and Practice of Informatics. LNCS 1521. Berlin, Heidelberg, New York: Springer- Verlag, 1998, pp. 419-428
38. Somenzi, F.: CUDD: CU Decision Diagram Package. University of Colorado at Boulder, http://vlsi.colorado.edu/pub/
39. Srivastava, A., Eustace, A.: ATOM: A systemfor building customized program analysis tools. In: Proc. ACM SIGPLAN'94 Conference on Programming Language Design and Implementation, pp. 196-205, June 1994
40. Stangier, C.: Accelerating variable reordering. Presented at the Dagstuhl Seminar on Decision Diagrams, Concepts and Applications, January 1999
41. Yang, B., Bryant, R.E., O'Hallaron, D.R., Biere, A., Coudert, O., Janssen, G., Ranjan, R.K., Somenzi, F.: A performance study of BDD-based model checking. In: Gopalakrishnan, G., Windley, P. (eds.): Formal Methods in Computer Aided Design. LNCS 1522. Berlin, Heidelberg, New York: Springer- Verlag, 1998, pp. 255-289
42. Yang, B., Chen, Y.-A., Bryant, R.E., O'Hallaron, D.R.: Space- and time-efficient BDD construction via working set control. In: Proc. of Asia and South Pacific Design Automation Conference (ASPDAC'98), pp. 423-432, Yokohama, Japan, February 1998.