Parallel model checking and the FMICS-jETI platform

Proceedings of the IEEE International Conference on Engineering of Complex Computer Systems, ICECCS

Volumn , Issue , 2007, Pages 330-338

  Barnat, Jiří ^a   Brim, Luboš ^a   Leucker, Martin ^b  

^a MASARYK UNIVERSITY   (Czech Republic)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; TEMPORAL LOGIC;

BRANCHING TIME; COMPUTATION TREE LOGIC; INTEGRATED ANALYSIS; INTEGRATED MODELING; LINEAR TIME TEMPORAL LOGIC; LOGIC COMPUTATION; MODELS CHECKING; P CALCULUS; PARALLEL MODEL CHECKING; PROPERTY;

MODEL CHECKING;

EID: 46749128168     PISSN: 27708527     EISSN: 27708535     Source Type: Conference Proceeding    
DOI: 10.1109/ICECCS.2007.34     Document Type: Conference Paper

References (55)

1. H. R. Andersen. Model checking and Boolean graphs. The oretical Computer Science, 126(1):3-30, 11 Apr. 1994.
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 I. Černá. Property Driven Distribution of Nested DFS. In Proceedinfs of the 3rd International Workshop on Verification and Computational Logic (VCL'02 - held at the PLI 2002 Symposium), pages 1-10. University of Southampton, UK, Technical Report DSSE-TR-2002-5 in DSSE, 2002.
4. J. Barnat, L. Brim, I. Černá, P. Moravec, P. Ročkai, and P. Šimeček. DiVinE - A Tool for Distributed Verification (Tool Paper). In Computer Aided Verification, volume 4144 of LNCS, pages 278-281. Springer, 2006.
5. G. Batt, D. Bergamini, H. de Jong, H. Garavel, and R. Mateescu. Model checking genetic regulatory networks using gna and cadp. In S. Graf and L. Mounier, editors, SPIN, volume 2989 of Lecture Notes in Computer Science, pages 158-163. Springer, 2004.
6. G. Behrmann, T. S. Hune, and F. W. Vaandrager. Distributed timed model checking -how the search order matters. In Proceedings of the 12th International Conference on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 216-231. Springer-Verlag, 2000.
7. A. Bell and B. R. Haverkort. Sequential and distributed model checking of petri net specifications. In Proceedings of the 1st Workshop on Parallel and Distributed Methods for Verification, volume 68 of Electronic Notes in Theoretical Computer Science, 2002.
8. th Annual IEEE Symposium on Logic in Computer Science, pages 304-312, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
9. B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation free μ-calculus. Technical Report AIB-04-2001, RWTH Aachen, Mar. 2001.
10. B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of Lecture Notes in Computer Science. Springer-Verlag Inc., 2002.
11. 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, 2004.
12. 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.
13. L. Brim, J. Crhova, and K. Yorav. Using assumptions to distribute CTL model checking. Electr. Notes Theor. Comput. Sci., 68(4), 2002.
14. L. Brim, I. Černá, P. Moravec, and J. Šimša. How to order vertices for distributed ltl model-checking based on accepting predecessors, volume 135.2 of Electronic Notes in Theoretical Computer Science, pages 3-18. Elsevier, 2006.
15. 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, 2003.
16. 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, 2003.
17. B. V Cherkassky and A. V Goldberg. Negative-Cycle Detection Algorithms. Mathematical Programming, 85:277-311, 1999.
18. G. Ciardo, J. Gluckman, and D. Nicol. Distributed State-Space Generation Of Discrete-State Stochastic Models. Technical Report TR-95-75, Institute for Computer Applications in Science and Engineering, 1995.
19. G. Ciardo, J. Gluckman, and D. Nicol. Distributed state-space generation of discrete-state stochastic models. INFORMS J. Comp., 10(1):82-93, 1998.
20. E. M. Clarke, Jr., O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
21. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mucalculus. In K. G. Larsen and A. Skou, editors, Proceedings of Computer-Aided Verification (CAV'91), volume 575 of Lecture Notes in Computer Science, pages 48-58, Berlin, Germany, July 1992. Springer.
22. C. Courcoubetics, M. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. In E. M. Clarke and R. P. Kurshan, editors, Computer-Aided Verification: Proc. of the 2nd International Conference CAV'90, pages 233-242. Springer, 1991.
23. M. Dam. CTL* and ECTL* as fragments of the modal μ-calculus. Theoretical Computer Science, 126(1):77-96, Apr. 1994.
24. 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.
25. E. Emerson and J. Y. Halpern. 'Sometimes' and 'Not Never' revisited: On branching versus linear time temporal logic. Journal of the ACM, 33(1): 151-178, 1985.
26. E. Emerson and C. Lei. Efficient model checking in fragments of the propositional μ-calculus. In Symposion on Logic in Computer Science, pages 267-278, Washington, D.C., USA, June 1986. IEEE Computer Society Press.
27. E. A. Emerson and E. M. Clarke. Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241-266, Dec. 1982.
28. E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model-checking for fragments of mu-calculus. In Proc. 5th International Computer-Aided Verification Conference, volume 697 of Lecture Notes in Computer Science, pages 385-396. Springer, 1993.
29. 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, 2001.
30. H. Garavel, R. Mateescu, and I. Smarandache. Parallel State Space Construction for Model-Checking. In Proceedings of the 8th International SPIN Workshop on Model Checking of Software (SPIN'01), volume 2057 of LNCS, pages 200-216. Springer, 2001.
31. J. Geldenhuys and A. Valmari. Tarjan's algorithm makes on-the-fly LTL verification more efficient. In TACAS'04, volume 2988 of Lecture Notes in Computer Science, pages 205-219. Springer, 2004.
32. 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.
33. F. Holmén, M. Leucker, and M. Lindström. UppDMC - a distributed model checker for fragments of the μ-calculus. volume 128/3 of Electronic Notes in Computer Science. Elsevier Science Publishers, 2004.
34. G. Holzmann. The Design of a Distributed Model Checking Algorithm for SPIN. In FMCAD, Invited Talk, 2006.
35. G. Holzmann and D. Bosnacki. Multi-core model checking with Spin. In HIPS-TopModels 2007, short paper, 2007.
36. C. Joubert and R. Mateescu. Distributed local resolution of boolean equation systems. In PDP, pages 264-271. IEEE Computer Society, 2005.
37. M. Jurdzinski. Small progress for solving parity games. In Proc. STACS, volume 1770 of LNCS, pages 290-301. Springer-Verlag, 2000.
38. W. Knottenbelt, P. Harrison, M. Mestern, and P. Kritzinger. A probabilistic dynamic technique for the distributed generation of very large state spaces. Performance Evaluation Journal, 39(1-4): 127-148, February 2000.
39. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333-354, Dec. 1983.
40. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, Mar. 2000.
41. A. L. Lafuente. Simplified distributed LTL model checking by localizing cycles. Technical Report 00176, Institut für Informatik, University Freiburg, Germany, July 2002.
42. F. Lerda and R. Sisto. Distributed-memory model checking with SPIN. In Proceedings of the 6th International SPIN Workshop on Model Checking of Software (SPIN'99), volume 1680 of LNCS, pages 22-39. Springer, 1999.
43. M. Leucker. Model checking games for the alternation free mu-calculus and alternating automata. In H. Ganzinger, D. McAllester, and A. Voronkov, editors, Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning "(LPAR'99)", volume 1705 of Lecture Notes in Artificial Intelligence, pages 77-91. Springer, 1999.
44. 2. In L. Brim and O. Grumberg, editors, Electronic Notes in Theoretical Computer Science, volume 89. Elsevier Science Publishers, 2003.
45. A. Mader. Verification of Modal Properties Using Boolean Equation Systems. PhD thesis, Technische Universität München, 1996.
46. T. Margaria, R. Nagel, and B. Steffen. Remote integration and coordination of verification tools in jeti. In Proc. of the 12th IEEE Int. Conf. on the Engineering of Computer-Based Systems (ECBS 2005), pages 431-436. IEEE Computer Society, 2005.
47. R. Pelánek. Typical structural properties of state spaces. In Proc. of SPIN Workshop, volume 2989 of LNCS, pages 5-22. Springer, 2004.
48. A. Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS-77), pages 46-57, Providence, Rhode Island, Oct. 31-Nov. 2 1977. IEEE Computer Society Press.
49. 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, 2000.
50. D. Schmidt and B. Steffen. Program analysis as model checking of abstract interpretations. In G. Levi, editor, Proc. 5th Static Analysis Symposium, volume 1503 of Lecture Notes in Computer Science, pages 351-381. Springer, 1998.
51. B. Steffen, T. Margaria, and R. Nagel, jeti: A tool for remote tool integration. In N. Halbwachs and L. D. Zuck, editors, Proc. of 11th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'05), volume 3440 of LNCS, Edinburgh, UK, April 2005. Springer Verlag.
52. C. Stirling. Games for bisimulation and model checking, July 1996. Notes for Mathfit Workshop on finite model theory, University of Wales, Swansea,.
53. U.Stern and D. L. Dill. Parallelizing the munφ verifier. In O. Grumberg, editor, Proceedings of Computer Aided Verification (CAV '97), volume 1254 of LNCS, pages 256-267. Springer, 1997.
54. M. Vardi. Automata-Theoretic Model Checking Revisited. In Proceedings of the 8th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI2007), volume 4349 of LNCS. Springer, 2007.
55. S. Zhang, O. Sokolsky, and S. A. Smolka. On the parallel complexity of model checking in the modal mu-calculus. In Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science, pages 154-163, Paris, France, 4-7 July 1994. IEEE Computer Society Press.