Combining partial order reductions with on-the-fly model-checking

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

Volumn 818 LNCS, Issue , 1994, Pages 377-390

  Peled, Doron ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

CONCURRENT PROGRAM; MODEL CHECKER; ON THE FLIES; PARTIAL ORDER; PARTIAL ORDER REDUCTIONS; REDUCE TIME; SUBSTANTIAL REDUCTION;

MODEL CHECKING;

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

References (20)

1. J.R. Büchi, On a decision method in restricted second order arithmetic, in E. Nagel et al. (eds.), Proceeding of the International Congress on Logic, Methodology and Philosophy of Science, Stanford, CA, Stanford University Press, 1960, 1-11.
2. C. Courcoubetis, M. Vardi, P. Wolper, M, Yanakakis, Memory-efficient algorithms for the verification of temporal properties, Formal methods in system design 1 (1992) 275-288.
3. J. C. Fernandez, L. Mounier, C. Jard, T. Jeron, On-the-fly verification of finite transition systems, Formal Methods in System Design 1 (1992), Kluwer, 251-273.
4. P. Godefroid, Using partial orders to improve automatic verification methods, Computer Aided Verification 1990, DIMACS, Vol 3, 1991, 321-339.
5. P. Godefroid, P. Wolper, A Partial Approach to Model Checking, 6th LICS, 1991, Amsterdam, 406-415.
6. G. J. Holzmann, Design and Validation of Computer Protocols, Prentice Hall Software Series, 1992.
7. G. J. Holzmann, P. Godefroid, D. Pirottin, Coverage preserving reduction strategies for reachability analysis, Proc. IFIP, Symp. on Protocol Specification, Testing, and Verification, June 1992, Orlando, U.S.A., 349-364.
8. G. J. Holzmann, D. Peled, STREM: A static reduction method, Manuscript, 1994, available from the authors.
9. S. Katz, D. Peled, Verification of distributed programs using representative interleaving sequences, Distributed Computing 6 (1992), 107-120.
10. S. Katz, D. Peled, Defining conditional independence using collapses,Theoretical Computer Science 101 (1992), 337-359, a preliminary version appeared in BCS-FACS Workshop on Semantics for Concurrency, Leicester, England, July 1990, Springer, 262-280.
11. R. P. Kurshan, Reducibility in analysis of coordination, Lecture Notes in Communication and Information, Springer, 103, 19-39.
12. M. Z. Kwiatkowska, Fairness for non-interleaving concurrency, Phd. Thesis, Faculty of Science, University of Leicester, 1989.
13. L. Lamport, What good is temporal logic, IF/P Congress, North Holland, 1983, 657-668.
14. O. Lichtenstein, A. Pnueli, Checking that finite-state concurrent programs satisfy their linear specification, 11 th ACM POPL, 1984, 97-107.
15. A. Mazurkiewicz, Trace semantics, Advances in Petri Nets 1986, LNCS 255, Springer, 1987, 279-324.
16. D, Peled, All from one, one for all, on model-checking using representatives, 5th international conference on Computer Aided Verification, Greece, 1993, LNCS, Springer, 409-423.
17. A. Valmari, Stubborn sets for reduced state space generation, 10th International Conference on Application and Theory of Petri Nets, Vol. 2, 1-22, Bonn, 1989.
18. A. Valmari, A Stubborn attack on state explosion, in E.M. Clarke, R.E Kurshan (eds.), CAV’90, DIMACS, Vol 3, 1991, 25-42.
19. A. Valmari, On-The-Fly Verification of stubborn sets, 5th CAV, Greece, 1993, LNCS 697, Springer, 397-408.
20. P. Wolper, M.Y. Vardi, A.P. Sistla, Reasoning about infinite computation paths, Proceedings of 24th IEEE symposium on foundation of computer science, Tuscan, 1983, 185-194.