A partitioning methodology for BDD-based verification

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

Volumn 3312, Issue , 2004, Pages 399-413

  Sahoo, Debashis ^a   Iyer, Subramanian ^b   Jain, Jawahar ^c   Stangier, Christian ^c   Narayan, Amit ^d   Dill, David L ^a   Allen Emerson, E ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c FUJITSU LABORATORIES OF AMERICA   (United States)

^d NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; FORMAL METHODS;

MEMORY EXPLOSION PROBLEM; ON STATE; ORDERS OF MAGNITUDE; PROBLEM-BASED; REACHABILITY; REACHABILITY ANALYSIS;

BOOLEAN FUNCTIONS;

EID: 32044465911     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30494-4_28     Document Type: Article

References (17)

1. B. Bollig and I. Wegener. Partitioned BDDs vs. other BDD models. In IWLS, 1997.
2. R. Bryant. Graph-based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35:677-691, August 1986.
3. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic Model Checking with Partitioned Transition Relations. In Proc. of the Design Automation Conf., pages 403-407, 1991.
4. G. Cabodi, P. Camurati, and Stefano Quer. Improved reachability analysis of large finite state machines. ICCAD, pages 354-360, 1996.
5. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. IBM Workshop on Logics of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71. SpringerVerlag, 1981.
6. O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines based on symbolic execution. In Proc. of the Workshop on Automatic Verification Methods for Finite State Systems, 1989.
7. Orna Grumberg, Tamir Heyman, and Assaf Schuster. Distributed symbolic model checking for μ-calculus. In Computer Aided Verification, pages 350-362, 2001.
8. S. Iyer, D. Sahoo, C. Stangier, A. Narayan, and J. Jain. Improved symbolic Verification Using Partitioning Techniques. In Proc. of CHARME 2003, volume 2860 of Lecture Notes in Computer Science, 2003.
9. J. Jain, J. Bitner, D. S. Fussell, and J. A. Abraham. Functional partitioning for verification and related problems. Brown/MIT VLSI Conference, 1992.
10. Kenneth L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
11. A. Narayan, A. Isles, J. Jain, R. Brayton, and A. Sangiovanni- Vincentelli. Reachability Analysis Using Partitioned-ROBDDs. In ICCAD, pages 388-393, 1997.
12. A. Narayan, J. Jain, M. Fujita, and A. Sangiovanni-Vincentelli. PartitionedROBDDs - A Compact, Canonical and Efficiently Manipulable Representation for Boolean Functions. In ICCAD, pages 547-554, 1996.
13. C Pixley. Introduction to a computational theory and implementation of sequential hardware equivalence. 1990.
14. K. Ravi and F. Somenzi. High-density reachability analysis. In ICCAD, pages 154158, 1995.
15. Fabio Somenzi. CUDD: CU Decision Diagram Package ftp://vlsi.colorado.edu/ pub, 2001.
16. H. J. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Implicit State Enumeration of Finite State Machines using BDD's. In ICCAD, pages 130-133, 1990.
17. VIS. Vis verilog benchmarks http://vlsi.colorado.edu/~vis/, 2001.