Skip to main content

Specification and Model Checking of the Chandy and Lamport Distributed Snapshot Algorithm in Rewriting Logic

  • Conference paper
Formal Methods and Software Engineering (ICFEM 2012)

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

Included in the following conference series:

Abstract

Many model checkers have been developed and then many case studies have been conducted by applying them to mechanical analysis of systems including distributed systems, protocols and algorithms. To the best of our knowledge, however, there are few case studies in which the Chandy & Lamport distributed snapshot algorithm is mechanically analyzed with model checkers. We think that this is because it is not straightforward to express the significant property that the algorithm should enjoy in LTL and CTL. In this paper, we describe how to specify the algorithm in Maude, a specification and programming language based on rewriting logic, and how to model check the significant property with the Maude search command, which demonstrates the power of the command. The case study also demonstrates the importance of case analysis in specification.

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

Access this chapter

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. Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359–364. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Holzmann, G.J.: The SPIN Model Checker – Primer and Reference Manual. Addison-Wesley (2004)

    Google Scholar 

  3. de Moura, L., Owre, S., Rueß, H., Rushby, J., Shankar, N., Sorea, M., Tiwari, A.: SAL 2. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 496–500. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Tsuchiya, T., Schiper, A.: Verification of consensus algorithms using satisfiability solving. Distributed Computing 23, 341–358 (2011)

    Article  MATH  Google Scholar 

  5. An, X., Pang, J.: Model checking round-based distributed algorithms. In: 15th IEEE ICECCS, pp. 127–135. IEEE (2010)

    Google Scholar 

  6. Ogata, K., Futatsugi, K.: Comparison of Maude and SAL by conducting case studies model checking a distributed algorithm. IEICE Trans. Fundamentals E90-A, 1690–1703 (2007)

    Article  Google Scholar 

  7. Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed system. ACM TOCS 3, 63–75 (1985)

    Article  Google Scholar 

  8. Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley (1988)

    Google Scholar 

  9. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: All About Maude. LNCS, vol. 4350. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  10. Lynch, N.A.: Distributed Algorithms. Morgan-Kaufmann (1996)

    Google Scholar 

  11. Ben-Ari, M.: Principles of the Spin Model Checker. Springer (2008)

    Google Scholar 

  12. Konnov, I.: CheAPS: a checker of asynchronous parameterized systems. In: WING 2010. EPiC Series, vol. 1, pp. 128–129. EasyChair (2012)

    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

Ogata, K., Thi Thanh Huyen, P. (2012). Specification and Model Checking of the Chandy and Lamport Distributed Snapshot Algorithm in Rewriting Logic. In: Aoki, T., Taguchi, K. (eds) Formal Methods and Software Engineering. ICFEM 2012. Lecture Notes in Computer Science, vol 7635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34281-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34281-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34280-6

  • Online ISBN: 978-3-642-34281-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics