Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers

Volumn C-35, Issue 8, 1986, Pages 677-691

  Bryant, Randal E ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

binary decision diagrams; Boolean functions; logic design verification; symbolic manipulation

Indexed keywords

COMPUTER METATHEORY - BOOLEAN FUNCTIONS; DATA PROCESSING - DATA STRUCTURES; LOGIC DESIGN;

ACYCLIC GRAPHS;

COMPUTER PROGRAMMING;

EID: 0022769976     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1986.1676819     Document Type: Article

References (19)

1. C. Y. Lee, “Representation of switching circuits by binary-decision programs,” Bell. Syst. Tech. J., vol. 38, pp. 985–999, July 1959.
2. S. B. Akers, “Binary decision diagrams,” IEEE Trans. Comput., vol. C-27, pp. 509–516, June 1978.
3. M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
4. F. J. Hill and G. R. Peterson, Introduction to Switching Theory and Logical Design. New York: Wiley, 1974.
5. J. P. Roth, Computer Logic, Testing, and Verification. Rockville, MD: Computer Science Press, 1980.
6. R. Brayton et al., “Fast recursive Boolean function manipulation,” in Proc. Int. Symp. Circuits and Syst., IEEE, Rome, Italy, May 1982, pp. 58–62.
7. B. M. E. Moret, “Decision trees and diagrams,” Ass. Comput. Mach., Comput. Surv., vol. 14, pp. 593–623, Dec. 1982.
8. S. Fortune, J. Hopcroft, and E. M. Schmidt, “The complexity of equivalence and containment for free single variable program schemes,” in Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 62, Goos, Hartmannis, Ausiello, and Boehm, Eds. Berlin: Springer-Verlag, 1978, pp. 227–240.
9. R. W. Payne, “Reticulation and other methods of reducing the size of printed diagnostic keys,” J. Gen. Microbiol., vol. 98, pp. 595–597, 1977.
10. R. Brayton et al., Logic Minimization Algorithms for VLSI Synthesis. Hingham, MA: Kluwer, 1984.
11. C. E. Shannon, “A symbolic analysis of relay and switching circuits,” Trans. AIEE, vol. 57, pp. 713–723 1938.
12. C. S. Wallace, “A suggestion for a fast multiplier,” IEEE Trans. Electron. Comput., vol. EC-13, pp. 14–17, Jan. 1964.
13. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
14. J. S. Jephson, R. P. McQuarrie, and R. E. Vogelsberg, “A three-level design verification system,” IBM Syst. J., vol. 8, no. 3, pp. 178–188, 1969.
15. TTL Data Book, Texas Instruments, Dallas, TX, 1976.
16. M. Rowan-Robinson, Cosmology. London: Oxford University Press, 1977.
17. S. B. Akers, “Functional testing with binary decision diagrams,” in Proc. 8th Ann. IEEE Conf. Fault-Tolerant Comput., 1978, pp. 75–82.
18. R. P. Brent and H. T. Kung, “The area-time complexity of binary multiplication,” J. Ass. Comput. Mach., vol. 28, pp. 521–534, July 1981.
19. H. Abelson and P. Andreae, “Information transfer and area-time tradeoffs for VLSI multiplication,” Commun. Ass. Comput. Mach., vol. 23, pp. 20–23, Jan. 1980.