Partial model checking with robdds

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

Volumn 1217, Issue , 1997, Pages 35-49

  Andersen, Henrik Reif ^a   Staunstrup, Jørgen ^a   Maretti, Niels ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; SPECIFICATIONS;

PARTIAL MODEL CHECKING; REDUCED ORDERED BINARY DECISION DIAGRAM; SELF REDUCING; STATE-BASED SYSTEMS; WEAKEST PRECONDITION;

MODEL CHECKING;

EID: 84944034340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0035379     Document Type: Conference Paper

References (17)

1. Henrik R. Andersen. Partial model checking (extended abstract). In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 398-407, La Jolla, San Diego, 26-29 July 1995. IEEE Computer Society Press.
2. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 8(C-35):677-691, 1986.
3. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P. B. Denyer, editors, Proc. 1991 Int. Conf. on VLSI, August 1991.
4. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: IO20 states and beyond. In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 428-439. IEEE Computer Society Press, 1990.
5. E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 353-362, Asilomar Conference Center, Pacific Grove, California, June 5-8 1989. IEEE Computer Society Press.
6. Olivier Coudert, Christian Berthet, and Jean Christophe Madre. Verification of synchronous sequential machines based on symbolic execution. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems. Proceedings, volume 407 of LNCS, pages 365-373. Springer-Verlag, 1989.
7. Mads Dam. Compositional proof systems for model checking infinite state systems. In I. Lee and S. Smolka, editors, CONCUR’95, 6th International Conference, volume 962 of Lecture Notes in Computer Science, pages 12-26, Philadelphia, PA, USA, August 21 - 24 1995.
8. E. W. Dijkstra. A discipline of programming. Englewood Cliffs, N. J.: Prentice-Hall, 1976.
9. Jo C. Ebergen and Ad M. G. Peeters. Design and analysis of delay-insensitive modulo-N counters. Formal Methods in Systems Design, 3(3), December 1993.
10. Patrice Godefroid and Pierre Wolper. A partial approach to model checking. In Proceedings, Sixth Annual IEEE Symposium, on Logic in Computer Science, pages 406-415, Amsterdam, The Netherlands, 15-18 July 1991. IEEE Computer Society Press.
11. R. P. Kurshan and Ken McMillan. A structural induction theorem for processes. In Eighth Annual ACM Symposium on Principles of Distributed Computing, pages 239-248. ACM, 1989.
12. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993.
13. Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
14. Christian D. Nielsen. Performance Aspects of Delay-Insensitive Design. PhD thesis, Department of Computer Science, Technical University of Denmark, 1994.
15. Jorgen Staunstrup. A formal approach to hardware design. Kluwer Academic Publishers, 1994.
16. Colin Stirling. A complete compositional modal proof system for a subset of CCS. volume 194 of Lecture Notes in Computer Science, pages 475-486. Springer-Verlag, 1985.
17. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955.