Partial-order reduction for general state exploring algorithms

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

Volumn 3925 LNCS, Issue , 2006, Pages 271-287

  Bošnački, Dragan ^a   Leue, Stefan ^b   Lafuente, Alberto Lluch ^c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF KONSTANZ   (Germany)

^c NONE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; EVALUATION; INFORMATION ANALYSIS; ITERATIVE METHODS; NUMERICAL METHODS; PROBLEM SOLVING; SET THEORY; STATE ESTIMATION; STATE SPACE METHODS;

GENERAL STATE EXPLORING ALGORITHMS (GSEA); PARTIAL-ORDER REDUCTION; STATE SPACE REDUCTION;

ALGORITHMS;

EID: 33745778909     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691617_16     Document Type: Conference Paper

References (28)

1. R. Alur, R.K. Brayton, T.A. Henzinger, S. Qadeer, and S.K. Rajamani, Partial-order reduction in symbolic state-space exploration, Formal Methods in System Design, 18:97-116, 2001.
2. A preliminary version appeared in Proc. of the 9th International Conference on Computer-aided Verification, CAV '97, LNCS 1254, pp. 340-351, Springer, 1997.
3. D. Bošnački, G.J. Holzmann, Improving Spin's Partial-Order Reduction for Breadth-First Search, Model Checking Software: 12th International SPIN Workshop, SPIN 2005, LNCS 3639, pp.91-105, Springer, 2005.
4. D. Bošnački, S. Leue, A. Lluch Lafuente, Partial-Order Reduction for General State Exploring Algorithms, Technical Report soft-05-02, Chair for Software Engineering, University of Konstanz, 2005. http://www.inf.uni-konstanz.de/soft/research/publications/pdf/soft-05-01.pdf
5. E. Clarke, O. Grumberg, D.A. Peled, Model Checking MIT Press, 2000.
6. S. Edelkamp, A. Lluch Lafuente and S. Leue, Directed explicit-state model checking in the validation of communication protocols, Software Tools for Technology Transfer, vol. 5, pp. 247-267, 2004.
7. S. Edelkamp, S. Leue and A. Lluch Lafuente, Partial-order reduction and trail improvement in directed model checking, International Journal on Software Tools for Technology Transfer, vol. 6, nr. 4, pp. 277-301, 2004.
8. R. Gerth, R. Kuiper, D. Peled, W. Penczek, A Partial-Order Approach to Branching Time Logic Model Checking, Information and Computation 150(2): 132-152, 1999.
9. P. Godefroid, Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State Space Explosion, LNCS 1032, Springer, 1996.
10. P. Godefroid, P. Wolper, Using Partial-Orders for the Efficient Verification of Deadlock Freedom and Safety Properties, Computer Added Verification, CAV '91, LNCS 575, pp. 332-342, Springer, 1991.
11. P.E. Hart, N.J. Nilsson and B. Raphael, A formal basis for heuristic determination of minimum path costs, IEEE Transactions on Systems Science and Cybernetics, 4:100-107, 1968.
12. G.J. Holzmann, The SPIN Model Checker: Primer and Reference Manual, Addison Wesley, 2003.
13. G.J. Holzmann, P. Godefroid, D. Pirottin, Coverage Preserving Reduction Strategies for Reachability Analysis, in Proc. 12th IFIP WG 6.1. International Symposium on Protocol Specification, Testing, and Validation, FORTE/PSTV '92, pp.349-363, North-Holland, 1992.
14. G.J. Holzmann, D. Peled, An Improvement in Formal Verification, FORTE 1994, Bern, Switzerland, 1994.
15. R.P. Kurshan, V. Levin, M. Minea, D. Peled, H. Yenigün, Static Partial-Order Reduction, in Tools and Algorithms for Construction and Analysis of Systems TACAS '98, LNCS 1384, pp. 345-357, 1998.
16. A. Lluch-Lafuente, S. Edelkarnp, S. Leue, Directed Search for the Verification of Communication Protocols, PhD Thesis, Freiburger Dokument Server, Institute of Computer Science, University of Freiburg, June 2003.
17. V. Levin, R. Palmer, S. Qadeer, S.K. Rajamani, Sound Transaction-Based Reduction Without Cycle Detection, Model Checking Software: 12th International SPIN Workshop, SPIN 2005, LNCS 3639, pp.106-121, Springer, 2005.
18. R. Nalumasu, G. Gopalakrishnan, An Efficient Partial-Order Reduction Algorithm with an Alternative Proviso Implementation, Formal Methods in System Design 20(3): 231-247, 2002.
19. N.J. Nilsson, Principles of Artificial Intelligence, Tioga Publishing Co. Palo Alto, California, 1980.
20. W.T. Overman, Verification of Concurrent Systems: Function and Timing, Ph.D. Thesis, UCLA, Los Angeles, California, 1981.
21. R. Palmer, G. Gopalakrishnan, A Distributed Partial Order Reduction Algorithm, Formal Techniques for Networked and Distributed Systems FORTE 2002, LNCS 2529, p.370, 2002.
22. J. Pearl, Heuristics, Addison-Wesley, 1985
23. D.A. Peled, Combining Partial-Order Reductions with On-the-Fly Model Checking, Formal Methods on Systems Design, 8: 39-64, 1996.
24. A previous version appeared in Computer Aided Verification 1994, LCNS 818, pp. 377-390, 1994.
25. B. Willems, P. Wolper, Partial-Order Models for Model Checking: From Linear to Branching Time, Proc. of 11 Symposium of Logics in Computer Science, LICS 96, New Brunswick, pp. 294-303, 1996.
26. A. Valmari, Eliminating Redundant Interleavings during Concurrent Program Verification, Proc. of Parallel Architectures and Languages Europe '89, vol. 2, LNCS 366, pp. 89-103, Springer, 1989.
27. A. Valmari, A Stubborn Attack on State Explosion, in Advances in Petri Nets, LNCS 531, pp. 156-165, Springer, 1991.
28. A. Valmari, The State Explosion Problem, Lectures on Petri Nets I: Basic Models, LNCS Tutorials, LNCS 1491, pp. 429-528, Springer, 1998.