Meta-BDDs: A decomposed representation for layered symbolic manipulation of boolean functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2102, Issue , 2001, Pages 118-130

  Cabodi, Gianpiero ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

COMPLEMENTATION; SYMBOLIC MANIPULATION; SYMBOLIC REPRESENTATION;

BOOLEAN FUNCTIONS;

EID: 84958744374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_11     Document Type: Conference Paper

References (15)

1. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
2. R. E. Bryant. Symbolic Boolean Manipulation with Ordered Binary-Decision Di- agrams. ACM Computing Surveys, 24(3):293-318, September 1992.
3. R. Rudell. Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In Proc. IEEE/ACM ICCAD'93, pages 42-47, San Jose, California, November 1993.
4. J. Jain, J. Bitner, J. A. Abraham, and D. S. Fussel. Functional Partitioning for Verifcation and Related Problems. In Brown/MIT VLSI Conference, pages 210-226, March 1992.
5. K. L. McMillan. A conjunctively decomposed boolean representation for symbolic model checking. Proc. CAV'96, Lecture Notes in Computer Science 1102, Springer Verlag, pages 13-25, August 1996.
6. G.J. Holzmann and A. Puri. A minimized automaton representation of reachable states. Software Tools for Technology Transfer, Springer Verlag, 3(1), 1999.
7. O. Coudert, C. Berthet, and J. C. Madre. Verifcation of Sequential Machines Based on Symbolic Execution. In Lecture Notes in Computer Science 407, Springer Verlag, pages 365-373, Berlin, Germany, 1989.
8. H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli. Im- plicit Enumeration of Finite State Machines Using BDDs. In Proc. IEEE IC-CAD'90, pages 130-133, San Jose, California, November 1990.
9. O. Coudert and J. C. Madre. A Unifed Framework for the Formal Verifcation of Sequential Circuits. In Proc. IEEE ICCAD'90, pages 126-129, San Jose, California, November 1990.
10. R.K. Brayton, R.K. Ranjan, J.V. Sanghavi and A. Sangiovanni-Vincentelli. High performance bdd package based on exploiting memory hierarchy. Proc. ACM/IEEE DAC'96, pages 635-640, June 1996.
11. F. Somenzi. CUDD: CU Decision Diagram Package-Release 2.3.0. Technicalreport, Dept. of Electrical and Computer Engineering, University of Colorado, Boulder, Colorado, October 1998.
12. MCNC Private Communication.
13. K. Ravi and F. Somenzi. Hints to Accelerate Symbolic Traversal. In Correct Hardware Design and VerifcationMethods (CHARME'99), pages 250-264, Berlin, September 1999. Springer-Verlag. LNCS 1703.
14. R. K. Ranjan, A. Aziz, R. K. Brayton, B. Plessier, and C. Pixley. Ecient BDD Algorithms for FSM Synthesis and Verifcation. In IWLS'95: IEEE International Workshop on Logic Synthesis, Lake Tahoe, California, May 1995.
15. A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Sym- bolic Model Verifyer. In Proc. CAV'99, Lecture Notes in Computer Science 1633, Springer Verlag, pages 495-499, July 1999.