Techniques for smaller intermediary BDDs

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

Volumn 2154, Issue , 2001, Pages 233-247

  Geldenhuys, Jaco ^a   Valmari, Antti ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS;

BINARY DECISION DIAGRAMS (BDDS); BINARY RELATION; FIXED POINTS; FIXED-POINT ALGORITHMS; STATE EXPLOSION PROBLEMS; TRANSITIVE CLOSURE;

BINARY DECISION DIAGRAMS;

EID: 84944035199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_16     Document Type: Conference Paper

References (30)

1. R. Alur, R.K. Brayton, T. Henzinger, S. Qadeer, & S.K. Rajamani. Partialorder reduction in symbolic state space exploration. In CAV’97: Proc. 9th Intl. Conf. Computer-Aided Verification, LNCS #1254, pp. 340–351. Springer-Verlag, Jun 1997.
2. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo, & F. Somenzi. Algebraic decision diagrams and their applications. In Proc. ACM/IEEE Intl. Conf. Computer-Aided Design, pp. 188–191, Nov 1993.
3. A. Biere, A. Cimatti, E.M. Clarke, & Y. Zhu. Symbolic model checking without BDDs. In Proc. 5th Intl. Conf. Tools and Algorithms for the Construction and Analysis of Systems, LNCS #1579, pp. 193–207. Springer-Verlag, Mar 1999.
4. R. Bloem, I.-H. Moon, K. Ravi, & F. Somenzi. Approximations for fixpoint computations in symbolic model checking. In Proc. World Multiconference on Systemics, Cybernetics and Informatics, Vol. 8, Part 2, pp. 701–706, 2000.
5. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers, C-35(8):677–691, Aug 1986.
6. J.R. Burch, E.M. Clarke, & D.E. Long. Symbolic model checking with partitioned transition relations. In Proc. IFIP Intl. Conf. Very Large Scale Integration, pp. 49–58, Aug 1991.
7. J.R. Burch, E.M. Clarke, D.E. Long, K.L. MacMillan, & D.L. Dill. Symbolic model checking for sequential circuit verification. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 13(4):401–424, Apr 1994.
8. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, & L.J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142–170, Jun 1992.
9. G. Cabodi, P. Camurati, L. Lavagno, & S. Quer. Disjunctive partitioning and partial iterative squaring: An effective approach for symbolic traversal of large circuits. In Proc. 34th ACM/IEEE Conf. Design Automation, pp. 728–733, Jun 1997.
10. G. Cabodi, P. Camurati, & S. Quer. Improved reachability analysis of large finite state machines. In Proc. ACM/IEEE Intl. Conf. Computer-Aided Design, pp. 354–360, Nov 1996.
11. G. Cabodi, P. Camurati, & S. Quer. Improving symbolic traversals by means of activity profiles. In Proc. 36th ACM/IEEE Conf. Design Automation, pp. 306–311, Jun 1999.
12. H. Cho, G.D. Hachtel, E. Macii, B. Plessier, & F. Somenzi. Automatic state space decomposition for approximate FSM traversal based on circuit analysis. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 15(12):1451–1464, Dec 1996.
13. H. Cho, G.D. Hachtel, E. Macii, B. Plessier, & F. Somenzi. Algorithms for approximate FSM traversal based on state space decomposition. IEEE Trans. Computer- Aided Design of Integrated Circuits and Systems, 15(12):1465–1478, Dec 1996.
14. O. Coudert, C. Berthet, & J.C. Madre. Verification of synchronous sequential machines based on symbolic execution. In Proc. Intl. Workshop on Automatic Verification Methods for Finite State Systems, LNCS #407, pp. 365–373. Springer- Verlag, Jun 1989.
15. M. Fujita, Y. Matsunaga, & T. Kakuda. On variable ordering of binary decision diagrams for the application of multi-level logic synthesis. In Proc. European Design Automation Conference, pp. 50–54, 1991.
16. S.G. Govindaraju, D.L. Dill, A.J. Hu, & M.A. Horowitz. Approximate reachability with BDDs using overlapping projections. In Proc. 35th ACM/IEEE Conf. Design Automation, pp. 451–456, Jun 1998.
17. A.J. Hu. Efficient Techniques for Formal Verification Using Binary Decision Diagrams. PhD thesis, Stanford Univ., 1995.
18. A.J. Hu, G. York, & D.L. Dill. New techniques for efficient verification with implicitly conjoined BDDs. In Proc. 31th ACM/IEEE Conf. Design Automation, pp. 276–282, Jun 1994.
19. S.-I. Minato. Zero-suppressed BDDs for set manipulation in combinatorial problems. In Proc. 30th ACM/IEEE Conf. Design Automation, pp. 272–277, Jun 1993.
20. T. Kam. State Minimization of Finite State Machines using Implicit Techniques. PhD thesis, Electronics Research Laboratory, Univ. of California at Berkeley, 1995.
21. R.P. Kurshan. Computer-aided Verification of Coordinating Processes: The Automata-theoretic Approach. Princeton University Press, 1994.
22. D.E. Long. Model Checking, Abstraction, and Compositional Verification. PhD thesis, Carnegie-Mellon Univ., 1993.
23. A. Miner & G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In Proc. 20th Intl. Conf. Application and Theory of Petri Nets, LNCS #1639, pp. 6–25. Springer-Verlag, Jun 1999.
24. A. Narayan, A.J. Isles, J. Jain, R.K. Brayton, & A.L. Sangiovanni-Vincentelli. Reachability analysis using partitioned-ROBDDs. In Proc. ACM/IEEE Intl. Conf. Computer-Aided Design, pp. 388–393, Nov 1997.
25. E. Pastor, O. Roig, J. Cortadella, & R. Badia. Petri net analysis using boolean manipulation. In Proc. 15th Intl. Conf. Application and Theory of Petri Nets, LNCS #815, pp. 416–435. Springer-Verlag, 1994.
26. K. Ravi & F. Somenzi. High-density reachability analysis. In Proc. ACM/IEEE Intl. Conf. Computer-Aided Design, pp. 154–158, Nov 1995.
27. K. Ravi & F. Somenzi. Hints to accelerate symbolic traversal. In Proc. 10th IFIP WG 10.5 Intl. Conf. Correct Hardware Design and Verification Methods, LNCS #1703, pp. 250–264. Springer-Verlag, Sept 1999.
28. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proc. ACM/IEEE Intl. Conf. Computer-Aided Design, pp. 42–47, Nov 1993.
29. A. Srinivasan, T. Kam, S. Malik, & R.K. Brayton. Algorithms for discrete function manipulation. In Proc. ACM/IEEE Intl. Conf. Computer-Aided Design, pp. 92–97, Nov 1990.
30. S. Waack. On the descriptive and algorithmic power of parity ordered binary decision diagrams. In Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science, LNCS #1200, pp. 201–212. Springer-Verlag, Feb 1997.