On-the-fly verification with stubborn sets

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

Volumn 697 LNCS, Issue , 1993, Pages 397-408

  Valmari, Antti ^a,b  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

^b VTT TECHNICAL RESEARCH CENTRE OF FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EFFICIENT DETECTION; LIVENESS PROPERTIES; MEMORY SAVINGS; NUMBER OF STATE; ON-THE FLY VERIFICATION; REDUCED-STATE; SIMPLE ALGORITHM; STUBBORN SETS;

COMPUTER AIDED ANALYSIS;

EID: 85029421081     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56922-7_33     Document Type: Conference Paper

References (16)

1. Aho, A. V.; Hopcroft, J. E. & Ullman, J. D.: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, 470 p.
2. Brinksma, E.: A Theory for the Derivation of Tests. Protocol Specification, Testing and Verification VIII (Proceedings of International IFIP WG 6.1 Symposium, 1988), North-Holland 1988, pp. 63-74.
3. Courcoubetis, C.; Vardi, M.; Wolper, P. & Yannakakis, M.: Memory Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design, 1: 275-288 (1992). (An earlier version appeared in Workshop on Computer-Aided Verification, New Brunswick, NJ, USA 1990.)
4. Godefroid, P.: Using Partial Orders to Improve Automatic Verification Methods. AMS-ACM DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 3, 1991, pp. 321-340. (An earlier version appeared in Workshop on Computer-Aided Verification, New Brunswick, NJ, USA 1990.)
5. Godefroid, P. & Wolper, P.: A Partial Approach to Model Checking. Proceedings of the 6th IEEE Symposium on Logic in Computer Science, Amsterdam, July 1991, pp. 406-415.
6. Godefroid, P. & Wolper, P.: Using Partial Orders for the Efficient Checking of Deadlock Freedom and Safety Properties. Proceedings of 3rd Workshop on Computer-Aided Verification 1991, Lecture Notes in Computer Science 575, Springer-Verlag 1992, pp. 332-342.
7. Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall 1985, 256 p.
8. Holzmann, G. J.: Design and Validation of Computer Protocols. Prentice-Hall 1991, 500 p.
9. Holzmann, G. J.; Godefroid, P. & Pirottin, D.: Coverage Preserving Reduction Strategies for Reachability Analysis. 14 p., Participant’s Proceedings of the 12th International Symposium on Protocol Specification, Testing and Verification, Lake Buena Vista, Florida, USA, 1992.
10. Kaivola, R. & Valmari, A.: The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic. Proceedings of CONCUR ’92, Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 207-221.
11. Valmari, A.: Error Detection by Reduced Reachability Graph Generation. Proceedings of the 9th European Workshop on Application and Theory of Petri Nets, Venice, Italy 1988, pp. 95-112.
12. Valmari, A.: Eliminating Redundant Interleavings during Concurrent Program Verification. Proceedings of Parallel Architectures and Languages Europe ’89, Lecture Notes in Computer Science 366, Springer-Verlag 1989, pp. 89-103.
13. Valmari, A.: Stubborn Sets for Reduced State Space Generation. Advances in Petri Nets 1990, Lecture Notes in Computer Science 483, Springer-Verlag 1991, pp. 491-515. (An earlier version appeared in Proceedings of the 10th International Conference on Application and Theory of Petri Nets, Bonn, Germany 1989, Vol. II pp. 1-22.)
14. Valmari, A.: A Stubborn Attack on State Explosion. Formal Methods in System Design, 1: 297-322 (1992). (An earlier version appeared in Workshop on Computer-Aided Verification, New Brunswick, NJ, USA 1990.)
15. Valmari, A. & Tienari, M.: An Improved Failures Equivalence for Finite State Systems with a Reduction Algorithm. Protocol Specification, Testing and Verification XI (Proceedings of International IFEP WG 6.1 Symposium, Stockholm, Sweden 1991), North-Holland 1991, pp. 3-18.
16. Valmari, A.: Alleviating State Explosion during Verification of Behavioural Equivalence. University of Helsinki, Department of Computer Science, Report A-1992-4, Helsinki 1992, 57 p.