Skip to main content

Parallelizing the Spin Model Checker

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7385)

Abstract

We describe an extension of the Spin model checker that allows us to take advantage of the increasing number of cpu-cores available on standard desktop systems. Our main target is to speed up the verification process for safety properties, the mode used most frequently, but we also describe a small modification of the parallel search algorithm, called the piggyback algorithm, that is remarkably effective in catching violations for an interesting class of liveness properties at little cost.

Keywords

  • parallelism
  • concurrency
  • multi-core
  • model checking
  • Spin
  • breadth-first search
  • safety
  • liveness
  • bounded search
  • software verification

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   72.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpern, B., Schneider, F.B.: Defining Liveness. Information Processing Letters 21, 181–185 (1985)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Barnat, J., Brim, L., Rockai, P.: Scalable shared memory LTL model checking. Int. Journal on Software Tools for Technology Transfer (STTT); special section with papers from the Spin 2007 Workshop 12(2), 139–153 (2010)

    Google Scholar 

  3. Bošnački, D., Holzmann, G.J.: Improving Spin’s Partial-Order Reduction for Breadth-First Search. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol. 3639, pp. 91–105. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  4. Holzmann, G.J., Peled, D.: An Improvement in Formal Verification. In: Proc. Formal Description Techniques, FORTE 1994, pp. 197–211. Chapman Hall, Berne (1994)

    Google Scholar 

  5. Holzmann, G.J.: The Spin Model Checker: primer and reference manual. Addison-Wesley (2004)

    Google Scholar 

  6. Holzmann, G.J., Bosnacki, D.: The design of a multi-core extension to the Spin model checker. IEEE Trans. on Softw. Eng. 33(10), 659–674 (2007)

    CrossRef  Google Scholar 

  7. Laarman, A.W., van de Pol, J.C., Weber, M.: Boosting multi-core reachability performance with shared hash-tables. In: Proc. 10th Int. Conf. on Formal Methods in Computer Aided Design, Publ. IEEE Computer Society, Lugano (2010)

    Google Scholar 

  8. Laarman, A., van de Pol, J., Weber, M.: Parallel Recursive State Compression for Free. In: Groce, A., Musuvathi, M. (eds.) SPIN Workshops 2011. LNCS, vol. 6823, pp. 38–56. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  9. Manna, Z., Pnueli, A.: Tools and rules for the practicing verifier, Stanford University. Technical Report STAN-CS-90-1321, 35 pgs (July 1990)

    Google Scholar 

  10. Pelánek, R.: BEEM: Benchmarks for Explicit Model Checkers. In: Bošnački, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 263–267. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holzmann, G.J. (2012). Parallelizing the Spin Model Checker. In: Donaldson, A., Parker, D. (eds) Model Checking Software. SPIN 2012. Lecture Notes in Computer Science, vol 7385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31759-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31759-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31758-3

  • Online ISBN: 978-3-642-31759-0

  • eBook Packages: Computer ScienceComputer Science (R0)