Skip to main content

Distributed-Memory Model Checking with SPIN

  • Conference paper
  • First Online:
Theoretical and Practical Aspects of SPIN Model Checking (SPIN 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1680))

Included in the following conference series:

Abstract

The main limiting factor of the model checker SPIN is currently the amount of available physical memory. This paper explores the possibility of exploiting a distributed-memory execution environment, such as a network of workstations interconnected by a standard LAN, to extend the size of the verification problems that can be successfully handled by SPIN. A distributed version of the algorithm used by SPIN to verify safety properties is presented, and its compatibility with the main memory and complexity reduction mechanisms of SPIN is discussed. Finally, some preliminary experimental results are presented.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. E. M. Clarke and J. M. Wing. Formal methods: state of the art and future directions.ACM Computing Surveys, 28(4)626–643, December 1996.

    Article  Google Scholar 

  2. P. J. A. de Villiers and W. C. Visser. ESML—a validation language for concurrentsystems. South African Computer Journal, 7:59–64, July 1992.

    Google Scholar 

  3. J.-Ch. Gr-egoire. State space compression in Spin with GETSs. In Proceedings of the 2nd SPIN Workshop, 1996.

    Google Scholar 

  4. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall Software Series, 1991.

    Google Scholar 

  5. G. J. Holzmann. State compression in Spin: recursive indexing and compression training runs. In Proceedings of the 3rd SPIN Workshop, 1997.

    Google Scholar 

  6. J. Rushby. Mechanized formal methods: progress and prospects. In Proceedings of the 16th Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science #1180, pages 43–51. Springer-Verlag, December 1996.

    Google Scholar 

  7. W. C. Visser. Memory efficient state storage in Spin. In Proceedings of the 2nd SPIN Workshop, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lerda, F., Sisto, R. (1999). Distributed-Memory Model Checking with SPIN. In: Dams, D., Gerth, R., Leue, S., Massink, M. (eds) Theoretical and Practical Aspects of SPIN Model Checking. SPIN 1999. Lecture Notes in Computer Science, vol 1680. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48234-2_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-48234-2_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66499-4

  • Online ISBN: 978-3-540-48234-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics