Symbolic verification with periodic sets

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

Volumn 818 LNCS, Issue , 1994, Pages 55-67

  Boigelot, Bernard ^a   Wolper, Pierre ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; SPACE RESEARCH;

BINARY DECISION DIAGRAMS (BDD); COMPLEX-PERIODIC; EXPLICIT REPRESENTATION; IMPLICIT REPRESENTATION; ITS APPLICATIONS; STATE EXPLOSION PROBLEMS; STATE SPACE EXPLORATION; SYMBOLIC VERIFICATION;

COMPUTER AIDED ANALYSIS;

EID: 84947479623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58179-0_43     Document Type: Conference Paper

References (30)

1. [ACD93] R. Alur, C. Courcoubetis, and D. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, May 1993.
2. 20 states and beyond. In Proceedings of the 5th Symposium on Logic in Computer Science, pages 428-439, Philadelphia, June 1990.
3. [Bry92] Randal E. Bryant. Symbolic boolean manipulation with ordered binary- decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
4. [CH78] P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proc. 5th ACM Symposium on Principles of Programming Langages, 1978.
5. [CMB90] O. Coudert, J. C. Madre, and C. Berthet. Verifying temporal properties of sequential machines without building their state diagram. In Proc. 2nd Workshop on Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 23-32, Rutgers, June 1990. Springer-Verlag.
6. [CVWY92] C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275-288, 1992.
7. [FM91] J.C. Fernandez and L. Mounier. On the fly verification of behavioural equivalences and preorders. In Proc. 3rd Workshop on Computer Aided Verification, volume 575 of Lecture Notes in Computer Science, pages 181- 191, Aalborg, July 1991.
8. [GL93] S. Graf and C. Loiseaux. A tool for symbolic program verification and abstraction. In Computer Aided Verification, Proc. 5th Int. Workshop, volume 697, pages 71-84, Elounda, Crete, June 1993. Lecture Notes in Computer Science, Springer-Verlag.
9. [God90] P. Godefroid. Using partial orders to improve automatic verification methods. In Proc. 2nd Workshop on Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 176-185, Rutgers, June 1990. Springer-Verlag.
10. [Gre71] H. Greenberg. Integer Programming. Academic Press, New York, 1971.
11. [GW93] P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods in System Design, 2(2):149-164, April 1993.
12. [Hal93] N. Halbwachs. Delay analysis in synchronous programs. In Proc. 5th Workshop on Computer Aided Verification, volume 697, Elounda, Crete, June 1993. Lecture Notes in Computer Science, Springer-Verlag.
13. [HGP92] G. J. Holzmann, P. Godefroid, and D. Pirottin. Coverage preserving reduction strategies for reachability analysis. In Proc. 12th International Symposium on Protocol Specification, Testing, and Verification, Lake Buena Vista, Florida, June 1992. North-Holland.
14. [Hol85] G. J. Holzmann. Tracing protocols. AT&T Technical Journal, 64(12):2413-2434, 1985.
15. [Hol91] G. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall International Editions, 1991.
16. [JJ89] C. Jard and T. Jeron. On-line model-checking for finite linear temporal logic specifications. In Automatic Verification Methods for Finite State Systems, Proc. Int. Workshop, Grenoble, volume 407, pages 189-196, Grenoble, June 1989. Lecture Notes in Computer Science, Springer-Verlag.
17. [Kri93] A. S. Krishnakumar. Reachability and recurrence in extended finite state machines: Modular vector addition systems. In Proc. 5th Workshop on Computer Aided Verification, volume 697, pages 110-122, Elounda, Crete, June 1993. Lecture Notes in Computer Science, Springer-Verlag.
18. [KSW90] F. Kabanza, J.-M. Stévenne, and P. Wolper. Handling infinite temporal data. In Proc. of the 9th ACM Symposium on Principles of Database Systems, pages 392-403, Nashville Tennessee, 1990.
19. [LeV92] H. LeVerge. A note on Chernikova’s algorithm. Research Report 1662, INRIA, Rennes, April 1992.
20. [Lub84] B. Lubachevsky. An approach to automating the verification of compact parallel coordination programs. I. Acta Informatica, 21:125-169, 1984.
21. [McM92] K. McMillan. Using unfolding to avoid the state explosion problem in the verification of asynchronous circuits. In Proc. fth Workshop on Computer Aided Verification, Montreal, June 1992.
22. [Mer90] N. Mercouroff. Analyse semantique de communications entre processus de programmes paralleles. Rapport de Recherche LIX/RR/90/09, Ecole Poly technique, Palaiseau, France, September 1990.
23. [Mur76] K. Murty. Linear and Combinatorial Programming. Wiley, New York, 1976.
24. [Pel93] D. Peled. All from one, one for all: on model checking using representatives. In Proc. 5th Conference on Computer Aided Verification, Elounda, June 1993. Lecture Notes in Computer Science, Springer-Verlag.
25. [Val89] A. Valmari. State space generation with induction. In Proc. Scandinavian Conference on Artificial Intelligence - 89, pages 99-115, Tampere, Finland, June 1989.
26. [Val90] A. Valmari. A stubborn attack on state explosion. In Proc. 2nd Workshop on Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 156-165, Rutgers, June 1990. Springer-Verlag.
27. [VW86] M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986.
28. [Wes78] C. H. West. Generalized technique for communication protocol validation. IBM J. of Res. and Devel., 22:393-404, 1978.
29. [WG93] P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In Proc. CONCUR '93, volume 715 of Lecture Notes in Computer Science, pages 233-246, Hildesheim, August 1993. Springer-Verlag.
30. [YL93] M. Yannakakis and D. Lee. An efficient algorithm for minimizing real-time transition systems. In Proc. 5th Workshop on Computer Aided Verification, volume 697, pages 210-224, Elounda, Crete, June 1993. Lecture Notes in Computer Science, Springer-Verlag.