Skip to main content
SpringerLink
Log in

Formal Proofs of Termination Detection for Local Computations by Refinement-Based Compositions

  • Conference paper
  • First Online:
Book cover Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ 2016)

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

Abstract

In this paper, we propose a formal framework enhancing the termination detection property of distributed algorithms and reusing their specifications as well as their proofs. By relying on refinement and composition, we show that an algorithm specified with local termination detection, can be reused in order to compute the same algorithm with global termination detection. The main idea relies upon the development of distributed algorithms following a top/down approach and the integration of additional computation steps developed in a pre-defined module. This module is specified in a generic and scalable way in order to be composed with particular developments. Once the composition link is proven, the global termination emerges automatically.

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 EPUB and 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

References

  1. Abrial, J.: Modeling in Event-B - System and Software Engineering. Cambridge University Press, New York (2010)

    Book  MATH  Google Scholar 

  2. Abrial, J.R., Butler, M., Hallerstede, S., Hoang, T.S., Mehta, F., Voisin, L.: Rodin: an open toolset for modelling and reasoning in event-b. Int. J. Softw. Tools Technol. Transf. 12(6), 447–466 (2010)

    Article  Google Scholar 

  3. Andriamiarina, M.B., Méry, D., Singh, N.K.: Revisiting snapshot algorithms by refinement-based techniques. Comput. Sci. Inf. Syst. 11(1), 251–270 (2014)

    Article  Google Scholar 

  4. Bauderon, M., Mosbah, M.: A unified framework for designing, implementing and visualizing distributed algorithms. Electr. Notes Theor. Comput. Sci. 72(3), 13–24 (2003). http://dx.doi.org/10.1016/S1571-0661(04)80608-X

    Article  Google Scholar 

  5. Boussabbeh, M., Tounsi, M., Hadjkacem, A., Mosbah, M.: Towards a general framework for ensuring and reusing proofs of termination detection in distributed computing. In: 24rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2016, Heraklion Crete, Greece, 17th-19th February 2016 (2016)

    Google Scholar 

  6. Cansell, D., Méry, D.: The event-B modelling method: concepts and case studies. In: Bjørner, D., Henson, M.C. (eds.) Logics of Specification Languages. Monographs in Theoretical Computer Science, pp. 47–152. Springer, Berlin (2008)

    Chapter  Google Scholar 

  7. Castéran, P., Filou, V.: Tasks, types and tactics for local computation systems. Stud. Inform. Univ. 9(1), 39–86 (2011)

    Google Scholar 

  8. Chalopin, J., Godard, E., Métivier, Y.: Local terminations and distributed computability in anonymous networks. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 47–62. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Chalopin, J., Godard, E., Métivier, Y.: Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distrib. Comput. 25(4), 297–311 (2012). http://dx.doi.org/10.1007/s00446-012-0163-y

    Article  MATH  Google Scholar 

  10. Chandy, K.M., Lamport, L.: Distributed snapshots: determining global states of distributed systems. ACM Trans. Comput. Syst. 3(1), 63–75 (1985). http://doi.acm.org/10.1145/214451.214456

    Article  Google Scholar 

  11. Chandy, K.M., Misra, J.: Parallel program design - a foundation. Addison-Wesley, UK (1989)

    MATH  Google Scholar 

  12. Chandy, K.M., Misra, J., Haas, L.M.: Distributed deadlock detection. ACM Trans. Comput. Syst. 1(2), 144–156 (1983). http://doi.acm.org/10.1145/357360.357365

    Article  Google Scholar 

  13. Courtieu, P., Rieg, L., Tixeuil, S., Urbain, X.: A certified universal gathering algorithm for oblivious mobile robots. CoRR abs/1506.01603 (2015)

    Google Scholar 

  14. Dijkstra, E.W., Scholten, C.S.: Termination detection for diffusing computations. Inf. Process. Lett. 11(1), 1–4 (1980). http://dx.doi.org/10.1016/0020-0190(80)90021-6

    Article  MathSciNet  MATH  Google Scholar 

  15. Filou, V., Mosbah, M., Tounsi, M.: Towards proved distributed algorithms through refinement, composition and local computations. In: 2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, Hammamet, Tunisia, 17–20 June 2013, pp. 353–358 (2013). http://dx.doi.org/10.1109/WETICE.2013.67

  16. Godard, E., Métivier, Y., Mosbah, M., Sellami, A.: Termination detection of distributed algorithms by graph relabelling systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 106–119. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Hoang, T.S., Abrial, J.-R.: Reasoning about liveness properties in event-b. In: Qin, S., Qiu, Z. (eds.) ICFEM 2011. LNCS, vol. 6991, pp. 456–471. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Iliasov, A., Troubitsyna, E., Laibinis, L., Romanovsky, A., Varpaaniemi, K., Ilic, D., Latvala, T.: Supporting reuse in event B development: modularisation approach. In: Frappier, M., Glässer, U., Khurshid, S., Laleau, R., Reeves, S. (eds.) ABZ 2010. LNCS, vol. 5977, pp. 174–188. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  19. Leavens, G.T., Abrial, J., Batory, D.S., Butler, M.J., Coglio, A., Fisler, K., Hehner, E.C.R., Jones, C.B., Miller, D., Jones, S.L.P., Sitaraman, M., Smith, D.R., Stump, A.: Roadmap for enhanced languages and methods to aid verification. In: Proceedings of 5th International Conference of Generative Programming and Component Engineering GPCE 2006, Portland, Oregon, USA, 22–26 October 2006, pp. 221–236 (2006). http://doi.acm.org/10.1145/1173706.1173740

  20. Litovsky, I., Métivier, Y., Sopena, E.: Graph relabelling systems and distributed algorithms. In: Handbook of Graph Grammars and Computing by Graph Transformation, pp. 1–56. World Scientific Publishing Co., Inc., River Edge (1999)

    Google Scholar 

  21. Mazurkiewicz, A.W.: Distributed enumeration. Inf. Process. Lett. 61(5), 233–239 (1997)

    Article  MathSciNet  Google Scholar 

  22. Szymanski, B.K., Shi, Y., Prywes, N.S.: Terminating iterative solution of simultaneous equations in distributed message passing systems. In: Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, Minaki, Ontario, Canada, 5–7 August 1985, pp. 287–292 (1985). http://doi.acm.org/10.1145/323596.323623

  23. Tounsi, M., Mosbah, M., Méry, D.: Proving distributed algorithms by combining refinement and local computations. ECEASST 35 (2010) http://journal.ub.tu-berlin.de/eceasst/article/view/442

  24. Tounsi, M., Mosbah, M., Méry, D.: From event-b specifications to programs for distributed algorithms. In: 2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, Hammamet, Tunisia, 17–20 June 2013. pp. 104–109 (2013). http://dx.doi.org/10.1109/WETICE.2013.44

Download references

Author information

Authors and Affiliations

  1. LaBRI Laboratory, University of Bordeaux, Talence, France

    Maha Boussabbeh & Mohamed Mosbah

  2. ReDCAD Laboratory, University of Sfax, Sfax, Tunisia

    Maha Boussabbeh, Mohamed Tounsi & Ahmed Hadj Kacem

Authors
  1. Maha Boussabbeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed Tounsi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohamed Mosbah
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ahmed Hadj Kacem
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maha Boussabbeh .

Editor information

Editors and Affiliations

  1. University of Southampton, Southampton, United Kingdom

    Michael Butler

  2. Software Competence Center, Hagenberg, Austria

    Klaus-Dieter Schewe

  3. Software Competence Center, Hagenberg, Austria

    Atif Mashkoor

  4. Software Competence Center, Hagenberg, Austria

    Miklos Biro

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Boussabbeh, M., Tounsi, M., Mosbah, M., Kacem, A.H. (2016). Formal Proofs of Termination Detection for Local Computations by Refinement-Based Compositions. In: Butler, M., Schewe, KD., Mashkoor, A., Biro, M. (eds) Abstract State Machines, Alloy, B, TLA, VDM, and Z. ABZ 2016. Lecture Notes in Computer Science(), vol 9675. Springer, Cham. https://doi.org/10.1007/978-3-319-33600-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33600-8_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33599-5

  • Online ISBN: 978-3-319-33600-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation