Relaxed visibility enhances partial order reduction

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

Volumn 1254, Issue , 1997, Pages 328-339

  Kokkarinen, Ilkka ^a   Peled, Doron ^b   Valmari, Antti ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

ATOMIC ACTIONS; AUTOMATIC VERIFICATION; CENTRAL PROBLEMS; CONCURRENT SYSTEMS; EXECUTION SEQUENCES; PARTIAL ORDER REDUCTIONS; STATE-SPACE EXPLOSION;

MODEL CHECKING;

EID: 84947442096     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63166-6_33     Document Type: Conference Paper

References (16)

1. C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakalds, Memory-efficient algorithms for the verification of temporal properties, Formal Methods in System Design 1 (1992) 275-288.
2. R. Gerth, D. Peled, M. Vardi, P. Wolper, Simple On-the-fly Automatic Verification of Linear Temporal Logic, PSTV95, Protocol Specification Testing and Verification, 3-18, Chapman & Hall, 1995, Warsaw, Poland.
3. P. Godefroid. Using partial orders to improve automatic verification methods. In Proc. 2nd Workshop on Computer Aided Verification, LNCS 531, Springer-Verlag, New Brunswick, N J, 1990, 176-185.
4. P. Godefroid, D. Pirottin, Refining dependencies improves partial order verification methods, 5th Conference on Computer Aided Verification, Elounda, Greece, LNCS 697, Springer-Verlag, 1993, 438-449.
5. P. Godefroid, P. Wolper, A Partial Approach to Model Checking, 6th Annual IEEE Symposium on Logic in Computer Science, 1991, Amsterdam, 406-415.
6. S. Katz, D. Peled, Verification of Distributed Programs using Representative Interleaving Sequences, Distributed Computing 6 (1992), 107-120.
7. S. Katz, D. Peled, Defining conditional independence using collapses, Theoretical Computer Science 101 (1992), 337-359.
8. I. Kokkarinen, Reduction of Parallel Labelled Transition Systems with Stubborn Sets, M. Sc. (Eng.) Thesis (in Finnish), 49 p.
9. L. Lamport, What good is temporal logic, Information Processing 83, Elsevier Science Publishers, 1983, 657-668.
10. D. Peled, All from one, one for all, on model-checking using representatives, 5th Conference on Computer Aided Verification, Elounda, Greece, 1993, LNCS 697, Springer-Verlag, 409-423.
11. D. Peled. Combining partial order reductions with on-the-fly model-checking. Formal Methods in System Design 8 (1996), 39-64.
12. A. Pnueli, The temporal logic of programs, 18th FOCS, IEEE Symposium on Foundation of Computer Science, 1977, 46-57.
13. A. Valmari, Stubborn sets for reduced state space generation, 10th International Conference on Application and Theory of Petri Nets, Bonn, Germany, 1989, LNCS 483, Springer-Verlag, 491-515.
14. A. Valmari, A stubborn attack on state explosion. Formal Methods in System Design, 1 (1992), 297-322.
15. A. Valmari, On-the-fly Verification with Stubborn Sets, 5th Conference on Computer Aided Verification, Elounda, Greece, 1993, LNCS 697, Springer-Verlag, 397-408.
16. B. Willems, P. Wolper, Partial-Order Methods for Model Checking: From Linear Time to Branching Time, 11th Annual IEEE Symposium on Logic in Computer Science, 1996.