Abstract
Randomised algorithms are generally simple to formulate. However, their analysis can become very complex, especially in the field of distributed computing. In this paper, we formally model in Coq a class of randomised distributed algorithms. We develop some tools to help proving impossibility results about classical problems and analysing this class of algorithms. As case studies, we examine the handshake and maximal matching problems. We show how to use our tools to formally prove properties about algorithms solving those problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Audebaud, P., Paulin-Mohring, C.: Proofs of randomized algorithms in Coq. Sci. Comput. Program. 74(8), 568–589 (2009)
Castéran, P., Filou, V.: Tasks, types and tactics for local computation systems. Studia Informatica Universalis 9(1), 39–86 (2011)
Chou, C.T.: Mechanical verification of distributed algorithms in higher-order logic. Comput. J. 38(2), 152–161 (1995)
Courtieu, P., Rieg, L., Tixeuil, S., Urbain, X.: Impossibility of gathering, a certification. Inf. Process. Lett. 115(3), 447–452 (2015)
Derman, C.: Finite State Markovian Decision Processes. Mathematics in Science and Engineering. Academic Press, Orlando (1970)
Deng, Y., Monin, J.F.: Verifying self-stabilizing population protocols with Coq. In: TASE, pp. 201–208 (2009)
Fontaine, A., Zemmari, A.: RDA: a Coq Library on Randomised Distributed Algorithms. http://www.allyxfontaine.com/RDA
Gonthier, G., Mahboubi, A., Tassi, E.: A Small Scale Reflection Extension for the Coq system. Rapport de recherche RR-6455, INRIA (2008)
Hurd, J., McIver, A., Morgan, C.: Probabilistic guarded commands mechanized in ol. Electr. Notes Theor. Comput. Sci. 112, 95–111 (2005)
Kwiatkowska, M.Z., Norman, G., Parker, D., Prism: probabilistic symbolic model checker. In: Computer Performance Evaluation/TOOLS, pp. 200–204 (2002)
Küfner, P., Nestmann, U., Rickmann, C.: Formal verification of distributed algorithms. In: Baeten, J.C.M., Ball, T., Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 209–224. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33475-7_15
Kwiatkowska, M.Z., Norman, G., Segala, R.: Automated verification of a randomized distributed consensus protocol using cadence SMV and PRISM. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 194–206. Springer, Heidelberg (2001)
Méry, D., Mosbah, M., Tounsi, M.: Refinement-based verification of local synchronization algorithms. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 338–352. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21437-0_26
Métivier, Y., Saheb, N., Zemmari, A.: Analysis of a randomized rendezvous algorithm. Inf. Comput. 184(1), 109–128 (2003)
Pogosyants, A., Segala, R.: Formal verification of timed properties for randomized distributed algorithms. In: PODC, pp. 174–183 (1995)
“Coq Development Team”. The Coq Proof Assistant Reference Manual. coq.inria.fr
Acknowledgement
The authors are grateful to P. Castéran who follows this work all along. We particularly thank him for his first proof in Coq of the impossibility result stated in Sect. 4.1 and for the development of the semantics that is the base of their development. They also thank C. Paulin-Mohring and A. Mahboubi for their help using Alea and ssreflect respectively.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Fontaine, A., Zemmari, A. (2016). Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms. In: Sampaio, A., Wang, F. (eds) Theoretical Aspects of Computing – ICTAC 2016. ICTAC 2016. Lecture Notes in Computer Science(), vol 9965. Springer, Cham. https://doi.org/10.1007/978-3-319-46750-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-46750-4_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46749-8
Online ISBN: 978-3-319-46750-4
eBook Packages: Computer ScienceComputer Science (R0)