Cluster-based LTL model checking of large systems

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

Volumn 4111 LNCS, Issue , 2006, Pages 259-279

  Barnat, Jiří ^a   Brim, Luboš ^a   Černá, Ivana ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

DISTRIBUTED ALGORITHMS; FINITE STATE SYSTEMS;

LARGE SCALE SYSTEMS;

EID: 33749594253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11804192_13     Document Type: Conference Paper

References (43)

1. T. Bao and M. Jones. Time-Efficient Model Checking with Magnetic Disks. In Proc. Tools and Algorithms for the Construction and Analysis of Systems, volume 3440 of LNCS, pages 526-540. Springer-Verlag, 2005.
2. J. Barnat, L. Brim, and J. Chaloupka. Parallel Breadth-First Search LTL Model-Checking. In Proc. 18th IEEE International Conference on Automated Software Engineering, pages 106-115. IEEE Computer Society, 2003.
3. J. Barnat, L. Brim, and J. Stříbrná. Distributed LTL model-checking in SPIN. In Proc. SPIN Workshop on Model Checking of Software, volume 2057 of LNCS, pages 200-216. Springer-Verlag, 2001.
4. J. Barnat, L. Brim, I. Černá, and P.Šimeček. DiVinE - The Distributed Verification Environment. In Proceedings of 4th International Workshop on Parallel and Distributed Methods in verification, pages 89-94, 2005.
5. J. Barnat and I. Černá. Distributed Breadth-First Search LTL Model Checking. Formal Methods in System Design, 2006. to appear.
6. Jiff Barnat. Distributed Memory LTL Model Checking. PhD thesis, Faculty of Informatics, Masaryk University Brno, 2004.
7. G. Behrmann, T. S. Hune, and F. W. Vaandrager. Distributed Timed Model Checking - How the Search Order Matters. In Proc. Computer Aided Verification, volume 1855 of LNCS, pages 216-231. Springer, 2000.
8. A. Bell and B. R. Haverkort. Sequential and distributed model checking of petri net specifications. Int J Softw Tools Technol Transfer, 7(1):43-60, 2005.
9. R. Bellman. On a Routing Problem. Quarterly of Applied Mathematics, 16(1):87-90, 1958.
10. S. Blom and S. Orzan. A Distributed Algorithm for Strong Bisimulation Reduction Of State Spaces. Int J Softw Tools Technol Transfer, 7(1):74-86, 2005.
11. B. Bollig, M. Leucker, and M. Weber. Parallel Model Checking for the Alternation Free μ-Calculus. In Proc. Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 543-558. Springer-Verlag, 2001.
12. L. Brim, I. Černá, P. Krčál, and R. Pelánek. Distributed LTL Model Checking Based on Negative Cycle Detection. In Proc. Foundations of Software Technology and Theoretical Computer Science, volume 2245 of LNCS, pages 96-107. Springer-Verlag, 2001.
13. L. Brim, I. Černá, P. Krčál, and R. Pelánek. How to Employ Reverse Search in Distributed Single-Source Shortest Paths. In Proc. Theory and Practice of Informatics (SOFSEM), volume 2234 of LNCS, pages 191-200. Springer-Verlag, 2001.
14. L. Brim, I. Černá, P. Moravec, and J. Šimša. Accepting Predecessors are Better than Back Edges in Distributed LTL Model-Checking. In Formal Methods in Computer-Aided Design (FMCAD 2004), volume 3312 of LNCS, pages 352-366. Springer-Verlag, 2004.
15. L. Brim, I. Černá, P. Moravec, and J. Šimša. Distributed Partial Order Reduction. Electronic Notes in Theoretical Computer Science. 128:63-74, 2005.
16. L. Brim, I. Černá, P. Moravec, and J. Šimša. How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors. In 4th International Workshop on Parallel and Distributed Methods in verification (PDMC'05), July 2005.
17. L. Brim, I. Černá, and L. Hejtmánek. Distributed Negative Cycle Detection Algorithms. In Proc. Parallel Computing: Software Technology, Algorithms, Architectures & Applications, volume 13 of Advances in Parallel Computing, pages 297-305. Elsevier, 2004.
18. I. Černá and R. Pelánek. Distributed Explicit Fair cycle Detection (Set Based Approach). In Model Checking Software. 10th International SPIN Workshop, volume 2648 of LNCS, pages 49-73. Springer-Verlag, 2003.
19. I. Černá and R. Pelánek. Relating Hierarchy of Temporal Properties to Model Checking. In Proc. Mathematical Foundations of Computer Science, volume 2747 of LNCS, pages 318-327. Springer-Verlag, 2003.
20. B. V. Cherkassky and A. V. Goldberg. Negative-Cycle Detection Algorithms. Mathematical Programming, 85:277-311, 1999.
21. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT, 1999.
22. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design, 1:275-288, 1992.
23. M. B. Dwyer, G. S. Avrunin, and J. C. Corbett. Property Specification Patterns for Finite-State Verification. In Proc. Workshop on Formal Methods in Software Practice, pages 7-15. ACM Press, 1998.
24. S. Edelkamp and S. Jabbar. Large-Scale Directed Model Checking LTL. In Model Checking Software: 13th International SPIN Workshop, volume 3925 of LNCS, pages 1-18. Springer-Verlag, 2006.
25. J. Esparza and S. Schwoon. A note on on-the-fly verification algorithms. In Proc. Tools and Algorithms for the Construction and Analysis of Systems, volume 3440 of LNCS, pages 174-190. Springer-Verlag, 2005.
26. K. Fisler, R. Fraer, G. Kamhi, M. Y. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In Proc. Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 420-434. Springer-Verlag, 2001.
27. L.R. Ford. Network Flow Theory. Rand Corp., Santa Monica, Cal., 1956.
28. H. Garavel, R. Mateescu, and I. Smarandache. Parallel State Space Construction for Model-Checking. In Proc. SPIN Workshop on Model Checking of Software, volume 2057 of LNCS, pages 216-234. Springer-Verlag, 2001.
29. O. Grumberg, T. Heyman, N. Ifergan, and A. Schuster, "achieving speedups in distributed symbolic reachability analysis through asynchronous computation". In Correct Hardware Design and Verification Methods, 13th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2005, Lecture Notes in Computer Science, pages 129-145. Springer, 2005.
30. O. Grumberg, T. Heyman, and A. Schuster. Distributed Model Checking for μ-calculus. In Proc. Computer Aided Verification, volume 2102 of LNCS, pages 350-362. Springer-Verlag, 2001.
31. B. R. Haverkort, A. Bell, and H. C. Bohnenkamp. On the Efficient Sequential and Distributed Generation of Very Large Markov Chains From Stochastic Petri Nets. In Proc. 8th Int. Workshop on Petri Net and Performance Models, pages 12-21. IEEE Computer Society Press, 1999.
32. G. J. Holzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2003.
33. G. J. Holzmann, D. Peled, and M. Yannakakis. On Nested Depth First Search. In Proc. SPIN Workshop on Model Checking of Software, pages 23-32. American Mathematical Society, 1996.
34. S. Jabbar and S. Edelkamp. Parallel External Directed Model Checking with Linear I/O. In Verification, Model Checking, and Abstract Interpretation: 7th International Conference, VMCAI 2006, volume 3855 of LNCS, pages 237-251. Springer-Verlag, 2006.
35. F. Lerda and R. Sisto. Distributed-Memory Model Checking with SPIN. In Proc. SPIN Workshop on Model Checking of Software, number 1680 in LNCS, pages 22-39. Springer-Verlag, 1999.
36. R. Pelánek. Typical Structural Properties of State Spaces. In Proc. of SPIN Workshop, volume 2989 of LNCS, pages 5-22. Springer-Verlag, 2004.
37. A. Pnueli. The Temporal Logic of Concurrent Programs. Theoretical Computer Science, 13:45-60, 1981.
38. K. Ravi, R. Bloem, and F. Somenzi. A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles. In Proc. Formal Methods in Computer-Aided Design, volume 1954 of LNCS, pages 143-160. Springer-Verlag, 2000.
39. J. Reif. Depth-first Search is Inherently Sequential. Information Proccesing Letters, 20(5):229-234, 1985.
40. U. Stern and D.L. Dill. Using magnetic disc instead of main memory in the murφ verifier. In Proc. of Computer Aided Verification, volume 1427 of LNCS, pages 172 - 183. Springer-Verlag, 1998.
41. R. Tarjan. Depth First Search and Linear Graph Algorithms. SIAM Journal on Computing, pages 146-160, Januar 1972.
42. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. IEEE Symposium on Logic in Computer Science, pages 322-331. Computer Society Press, 1986.
43. Pavel Šimeček. DiVinE - Distributed Verification Environment. Master's thesis, Masaryk Univeristy Brno, 2006.