State space caching revisited

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

Volumn 663 LNCS, Issue , 1993, Pages 178-191

  Godefroid, Patrice ^a   Holzmann, Gerard J ^b   Pirottin, Didier ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SPACE RESEARCH;

CONCURRENT SYSTEMS; EXECUTION SEQUENCES; EXPONENTIAL INCREASE; PARTIAL ORDERING; REACHABILITY ANALYSIS; STATE SPACE EXPLORATION; STATEMENT EXECUTION; VERIFICATION METHOD;

COMPUTER AIDED ANALYSIS;

EID: 84976767702     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56496-9_15     Document Type: Conference Paper

References (16)

1. C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Iq Proe. 2ad Workshop ou Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 233-242, Rutgers, June 1990.
2. P. Godefroid. Using partial orders to improve automatic verification methods. In Proe. 2nd Workshop on Compuler Aided Verification, volume 531 of Leclure Noles in Com. puer Science, pages 176-185, Rutgers, June 1990.
3. P. Godefroid and P. Wolper. A partial approach to model checking. Ill Proceedinys of the 6lh IEEE Symposium on Logic ia COmLpuler Scieuce, pagcs 406-415, Amsterdam. July 1991.
4. P. Godefroid and P. Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. In Proc. 3rd Workshop ou Computer Aided Verificalion, volume 575 of Lecture Noles in Compuler Science, pages 332-342, Aalborg, July 1991.
5. G. J. Holzmann, P. Godefroid, and D. Pirottin. Coverage preserving reduction strategies for reachability analysis. Ill Proc. 12th lalerua~iouat Symposium on Prolocol Specification, Tesling, and Verification, Lake Buena Vista, Florida, June 1992. North-lIolland.
6. G. J. llolzmann. Pan -- a protocol specification analyzer. Technical report, Technical Memorandum 81-11271-5, Bell Laboratories, 1981.
7. G. J. lIolzmann. The pandora system -- an interactive system for the design of data communication protocols. Compuler Networks, 8(2):71-81, 1984.
8. G. J. Holzmnnn. Tracing protocols. ATgdT Technical Journal, 64(12):2413-2434, 1985.
9. G. J. Holzmann. Automated protocol validation in argos -- assertion proving and scatter searching. IEEE Trans. on Software Engineering, 13(6):683-696, 1987.
10. G. J. Holzmann. Algorithms for automated protocol validation. AT&AT Technical Journal, 69(1):32-44, 1990. Special issue on Protocol Testing and Verification.
11. G. J. Itolzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
12. C. Jard and T. leron. On-line model-checking for finite linear temporal logic specifications. In Workshop on automatic verification methods for finite state systems, volume 407 of Lecture Notes in Computer Science, pages 189-196, Grenoble, June 1989.
13. C. Jard and Th. Jeron. Bounded-memory algorithms for verification on-the-fly. In Proc. 3rd Workshop on Computer Aided Verification, volume 575 of Lecture Notes in Computer Science, Aalborg, July 1991.
14. A. Mazurkiewicz. Trace theory. Ill Pctri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Pelri Nets 1986, Part 11; Proceedings of an Advanced Course, volume 255 of Lecture Notes in Computer Science, pages 279-324, 1986.
15. M. Trehel and M. Naimi. Un algorithme distribud d'exclusion mutuelle en log(n). Technique et Science lnformatiqaes, pages 141-150, 1987.
16. M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Comp~ter and System Science, 32(2):182-21, April 1986.