Skip to main content
SpringerLink
Log in

Towards Informed Swarm Verification

  • Conference paper
NASA Formal Methods (NFM 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6617))

Included in the following conference series:

Abstract

In this paper, we propose a new method to perform large scale grid model checking. A manager distributes the workload over many embarrassingly parallel jobs. Only little communication is needed between a worker and the manager, and only once the worker is ready for more work. The novelty here is that the individual jobs together form a so-called cumulatively exhaustive set, meaning that even though each job explores only a part of the state space, together, the tasks explore all states reachable from the initial state.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnat, J., Brim, L., Ročkai, P.: Scalable multi-core LTL model-checking. In: Bošnački, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 187–203. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Barnat, J., Brim, L., Ročkai, P.: DiVinE multi-core – A parallel LTL model-checker. In: Cha, S(S.), Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol. 5311, pp. 234–239. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Barnat, J., Brim, L., Stříbrná, J.: Distributed LTL model-checking in SPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 200–216. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Behrmann, G., Hune, T., Vaandrager, F.: Distributing Timed Model Checking - How the Search Order Matters. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 216–231. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Blom, S.C.C., Calamé, J.R., Lisser, B., Orzan, S., Pang, J., van de Pol, J.C., Torabi Dashti, M., Wijs, A.J.: Distributed Analysis with μCRL: A Compendium of Case Studies. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 683–689. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Blom, S.C.C., Lisser, B., van de Pol, J.C., Weber, M.: A Database Approach to Distributed State Space Generation. In: Haverkort, B., Černá, I. (eds.) PDMC 2007. ENTCS, vol. 198, pp. 17–32. Elsevier, Amsterdam (2007)

    Google Scholar 

  7. Blom, S.C.C., van de Pol, J., Weber, M.: LTSmin: distributed and symbolic reachability. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 354–359. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. BOINC: Visited on 18 February (2011), http://boinc.berkeley.edu

  9. Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  Google Scholar 

  10. Dill, D.: The Murphi Verification System. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 390–393. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  11. Dwyer, M.B., Elbaum, S.G., Person, S., Purandare, R.: Parallel Randomized State-space Search. In: 29th Int. Conference on Software Engineering, pp. 3–12. IEEE Press, New York (2007)

    Google Scholar 

  12. Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. STTT 5(2), 247–267 (2004)

    Article  MATH  Google Scholar 

  13. Engels, T.A.N., Groote, J.F., van Weerdenburg, M.J., Willemse, T.A.C.: Search Algorithms for Automated Validation. JLAP 78(4), 274–287 (2009)

    MATH  Google Scholar 

  14. Foster, I.: Designing and Building Parallel Programs. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  15. Garavel, H., Mateescu, R., Bergamini, D., Curic, A., Descoubes, N., Joubert, C., Smarandache-Sturm, I., Stragier, G.: DISTRIBUTOR and BCG_MERGE: Tools for distributed explicit state space generation. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 445–449. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Groce, A., Joshi, R.: Exploiting traces in static program analysis: better model checking through printfs. STTT 10(2), 131–144 (2008)

    Article  Google Scholar 

  17. Groote, J.F., Keiren, J., Mathijssen, A., Ploeger, B., Stappers, F., Tankink, C., Usenko, Y.S., Weerdenburg, M.J.: The MCRL2 Toolset. In: 1st Int. Workshop on Academic Software Development Tools and Techniques 2008, pp. 5-1/10 (2008)

    Google Scholar 

  18. Groote, J.F., Ponse, A.: The Syntax and Semantics of μCRL. In: Algebra of Communicating Processes 1994. Workshops in Computing, pp. 26–62. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  19. Hart, P.E., Nilsson, N.J., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Trans. on Systems, Science and Cybernetics 2, 100–107 (1968)

    Article  Google Scholar 

  20. Holzmann, G.J.: A Stack-Slicing Algorithm for Multi-Core Model Checking. In: Haverkort, B., Černá, I. (eds.) PDMC 2007. ENTCS, vol. 198, pp. 3–16. Elsevier, Amsterdam (2007)

    Google Scholar 

  21. Holzmann, G.J., Bošnački, D.: The Design of a Multicore Extension of the SPIN Model Checker. IEEE Trans. On Software Engineering 33(10), 659–674 (2007)

    Article  Google Scholar 

  22. Holzmann, G.J., Joshi, R., Groce, A.: Swarm Verification. In: 23rd IEEE/ACM Int. Conference on Automated Software Engineering, pp. 1–6. IEEE Press, New York (2008)

    Google Scholar 

  23. Holzmann, G.J., Joshi, R., Groce, A.: Tackling large verification problems with the swarm tool. In: Havelund, K., Majumdar, R. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 134–143. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  24. Holzmann, G.J., Joshi, R., Groce, A.: Swarm Verification Techniques. IEEE Trans. On Software Engineering (2010) (to appear)

    Google Scholar 

  25. Korf, R.E.: Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Artificial Intelligence 27(1), 97–109 (1985)

    Article  MATH  Google Scholar 

  26. Laarman, A., van de Pol, J.C., Weber, M.: Boosting Multi-Core Reachability Performance with Shared Hash Tables. In: Int. Conference on Formal Methods in Computer-Aided Design (2010)

    Google Scholar 

  27. Lerda, F., Sisto, R.: Distributed-Memory Model Checking with SPIN. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) SPIN 1999. LNCS, vol. 1680, pp. 22–39. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  28. Lowerre, B.T.: The HARPY speech recognition system. PhD thesis, Carnegie-Mellon University (1976)

    Google Scholar 

  29. Luttik, S.P.: Description and Formal Specification of the Link Layer of P1394. Technical Report SEN-R 9706, CWI (1997)

    Google Scholar 

  30. Pelánek, R., Hanžl, T., Černá, I., Brim, L.: Enhancing Random Walk State Space Exploration. In: 10th Int. Workshop on Formal Methods for Industrial Critical Systems. ACM SIGSOFT, pp. 98–105 (2005)

    Google Scholar 

  31. Peled, D., Pratt, V., Holzmann, G.J. (eds.): Partial Order Methods in Verification. Series in Discrete Mathematics and Theoretical Computer Science 29 (1996)

    Google Scholar 

  32. Romein, J.W., Plaat, A., Bal, H.E., Schaeffer, J.: Transposition Table Driven Work Scheduling in Distributed Search. In: 16th National Conference on Artificial Intelligence, pp. 725–731. AAAI Press, Menlo Park (1999)

    Google Scholar 

  33. Russell, S., Norvig, P.: Artificial intelligence: A modern approach. Prentice-Hall, New Jersey (1995)

    MATH  Google Scholar 

  34. SETI@home, http://setiathome.berkeley.edu (Visited on 18 February 2011)

  35. Sivaraj, H., Gopalakrishnan, G.: Random Walk Based Heuristic Algorithms for Distributed Memory Model Checking. ENTCS, vol. 89, pp. 51–67 (2003)

    Google Scholar 

  36. Staats, M., Pǎsǎreanu, C.: Parallel Symbolic Execution for Structural Test Generation. In: 19th Int. Conference on Software Testing and Analysis, pp. 183–194. ACM, New York (2010)

    Google Scholar 

  37. Torabi Dashti, M., Krishnan Nair, S., Jonker, H.L.: Nuovo DRM Paradiso: Towards a Verified Fair DRM Scheme. Fundamenta Informaticae 89(4), 393–417 (2008)

    MATH  Google Scholar 

  38. Torabi Dashti, M., Wijs, A.J.: Pruning state spaces with extended beam search. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 543–552. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  39. Valente, J.M.S., Alves, R.A.F.S.: Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time. Computers & Industrial Engineering 48(2), 363–375 (2005)

    Article  Google Scholar 

  40. West, C.H.: Protocol Validation by Random State Exploration. In: 8th Int. Conference on Protocol Specification, Testing and Verification, pp. 233–242. North-Holland, Amsterdam (1986)

    Google Scholar 

  41. Wijs, A.J.: What to Do Next?: Analysing and Optimising System Behaviour in Time. PhD thesis, Vrije Universiteit Amsterdam (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Eindhoven University of Technology, 5612 AZ, Eindhoven, The Netherlands

    Anton Wijs

Authors
  1. Anton Wijs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. NASA Jet Propulsion Laboratory, 4800 Oak Grove Drive, M/S 301-285, 91109, Pasadena, CA, USA

    Mihaela Bobaru , Klaus Havelund , Gerard J. Holzmann  & Rajeev Joshi , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wijs, A. (2011). Towards Informed Swarm Verification. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds) NASA Formal Methods. NFM 2011. Lecture Notes in Computer Science, vol 6617. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20398-5_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20398-5_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20397-8

  • Online ISBN: 978-3-642-20398-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation