Algebraic Decision Diagrams and Their Applications

Formal Methods in System Design

Volumn 10, Issue 2-3, 1997, Pages 171-206

  Bahar, R I ^a   Frohm, E A ^a   Gaona, C M ^a   Hachtel, G D ^a   Macii, E ^a,b   Pardo, A ^a   Somenzi, F ^a  

^a University of Colorado   (United States)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Decision diagrams; Graph algorithms; Linear algebra

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; GRAPH THEORY; MATRIX ALGEBRA;

ALGEBRAIC DECISION DIAGRAMS (ADD);

DATA STRUCTURES;

EID: 0031122218     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008699807402     Document Type: Article

References (23)

1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
2. G. Boole, The Mathematical Analysis of Logic, Macmillan, 1847, Reprinted by B. Blackwell, Oxford, UK, 1951.
3. K.S. Brace, R. Rudell, and R. Bryant, "Efficient implementation of a BDD package," DAC-27: ACM/IEEE Design Automation Conference, Orlando, FL, June 1990, pp. 40-45.
4. F.M. Brown, Boolean Reasoning: The Logic of Boolean Equations, Kluwer Academic Publishers, 1990.
5. R. Bryant, "Graph-Based Algorithms for Boolean function manipulation," IEEE Transactions on Computers, Vol. C-35, No. 8, pp. 79-85, Aug. 1986.
6. J.R. Burch, E.M. Clarke, K.L. McMillan, and D.L. Dill, "Sequential circuit verification using symbolic model checking," DAC-27: ACM/IEEE Design Automation Conference, Orlando, FL, June 1990, pp. 46-51.
7. J.R. Burch, E.M. Clarke, and D.E. Long, "Representing circuits more efficiently in symbolic model checking," DAC-28: ACM/IEEE Design Automation Conference, San Francisco, CA, June 1991, pp. 403-407.
8. H. Cho, G.D. Hachtel, S.W. Jeong, B. Plessier, E. Schwarz, and F. Somenzi, "ATPG aspects of FSM verification," ICCAD-90: IEEE International Conference on Computer Aided Design, Santa Clara, CA, Nov. 1990, pp. 134-137.
9. H. Cho, G.D. Hachtel, E. Macii, B. Plessier, and F. Somenzi, "Algorithms for approximate FSM traversal," DAC-30: ACM/IEEE Design Automation Conference, Dallas, TX, June 1993, pp. 25-30.
10. E.M. Clarke, K.L. McMillan, X. Zhao, M. Fujita, and J. Yang, "Spectral transforms for large Boolean functions with applications to technology mapping," DAC-30: ACM/IEEE Design Automation Conference, Dallas, TX, June 1993, pp. 54-60.
11. E.M. Clarke, M. Fujita, P.C. McGeer, K. McMillan, and J. Yang, "Multi-terminal binary decision diagrams: An efficient data structure for matrix representation," IWLS'93: International Workshop on Logic Synthesis, Lake Tahoe, CA, May 1993, pp. 6a:1-15.
12. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, An Introduction to Algorithms, McGraw-Hill, 1990.
13. O. Coudert, C. Berthet, and J.C. Madre, "Verification of sequential machines based on symbolic execution," Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science, Vol. 407, pp. 365-373, 1989.
14. O. Coudert, C. Berthet, and J.C. Madre, "Verification of sequential machines using boolean functional vectors," IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, Leuven, Belgium, Nov. 1989, pp. 111-128.
15. I.S. Duff, "Harwell Subroutine Library," AERE Report R.8730, Atomic Energy Research Establishment, Oxon, England, 1977.
16. I.S. Duff, A.M. Erisman, and J.K. Reid, Direct Methods for Sparse Matrices, Clarendon Press, 1986.
17. I.S. Duff, R.G. Grimes, and J.G. Lewis, "Sparse matrix test problems," ACM Transactions on Mathematical Software, Vol. 15, pp. 1-14, 1989.
18. S. Even, Graph Algorithms, Computer Science Press, 1979.
19. F.G. Gustavson, "Efficient algorithm to perform sparse matrix multiplication," IBM Technical Disclosure Bulletin, Vol. 20, No. 3, pp. 1262-1264, Aug. 1977.
20. G.D. Hachtel, R.K. Brayton, and F.G. Gustavson, "The sparse tableau approach to network analysis and design," IEEE Transactions on Circuit Theory, Vol. CT-18, No. 1, pp. 101-113, Jan. 1971.
21. G.D. Hachtel, E. Macii, A. Pardo, and E Somenzi, "Symbolic algorithms to calculate steady-state probabilities of a finite state machine," EDAC-94: IEEE European Conference on Design Automation, Paris, France, Feb. 1994, pp. 214-218.
22. G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi, "Probabilistic analysis of large finite state machines," DAC-31: ACM/IEEE Design Automation Conference, San Diego, CA, June 1994, pp. 270-275.
23. H. Touati, H. Savoj, B. Lin, R. Brayton, and A. Sangiovanni-Vincentelli, "Implicit enumeration of finite state machines using BDDs," ICCAD-90: IEEE International Conference on Computer Aided Design, Santa Clara, CA, Nov. 1990, pp. 130-133.