Tasks, Types and Tactics for Local Computation Systems

We present a formalization inCoqoflocal computations, a model for distributed computing based on graph relabelling. This formalization allows one to prove the correctness of distributed algorithms, as well as to compare various synchronisation and termination detection modes. We illustrate our approach by two impossibility proofs, and by a certified algorithm transformation.

[1]  Xavier Urbain,et al.  Modular and Incremental Automated Termination Proofs , 2004, Journal of Automated Reasoning.

[2]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[3]  Masafumi Yamashita,et al.  Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct , 1999, IEEE Trans. Parallel Distributed Syst..

[4]  Yves Métivier,et al.  Election and Local Computations on Edges , 2004, FoSSaCS.

[5]  Pierre Castéran,et al.  Interactive Theorem Proving and Program Development , 2004, Texts in Theoretical Computer Science An EATCS Series.

[6]  Stefan Gruner,et al.  A New Tool for the Simulation And Visualization of Distributed Algorithms , 2000 .

[7]  Stéphane Lescuyer.  Conteneurs de première classe en Coq , 2010 .

[8]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[9]  Yves Métivier,et al.  On the Recognition of Families of Graphs with Local Computations , 1995, Inf. Comput..

[10]  Christine Paulin-Mohring,et al.  The coq proof assistant reference manual , 2000 .

[11]  Pierre Castéran,et al.  Certifying Distributed Algorithms by Embedding Local Computation Systems in the Coq Proof Assistant , 2009 .

[12]  Jean-François Dufourd,et al.  Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps , 2008, STACS.

[13]  Jérémie Chalopin.  Algorithmique distribuée, calculs locaux et homomorphismes de graphes , 2006 .

[14]  Georges Gonthier.  A computer-checked proof of the Four Colour Theorem , 2005 .

[15]  Yves Bertot,et al.  Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .

[16]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[17]  Panagiotis Manolios,et al.  Computer-Aided Reasoning: An Approach , 2011 .

[18]  Jean-Raymond Abrial,et al.  Modeling in event-b - system and software engineering by Jean-Raymond Abrial , 2010, SOEN.

[19]  Pierre Courtieu,et al.  Certifying a Termination Criterion Based on Graphs, without Graphs , 2008, TPHOLs.

[20]  Gruia-Catalin Roman,et al.  An Introduction to Mobile UNITY , 1998, IPPS/SPDP Workshops.

[21]  Yves Métivier,et al.  Checking global graph properties by means of local computations: the majority problem , 1995, Electron. Notes Theor. Comput. Sci..

[22]  Pierre Courtieu,et al.  Certification of Automated Termination Proofs , 2007, FroCoS.

[23]  Matthieu Sozeau,et al.  First-Class Type Classes , 2008, TPHOLs.

[24]  Yves Métivier,et al.  About the Termination Detection in the Asynchronous Message Passing Model , 2007, SOFSEM.

[25]  Antoni W. Mazurkiewicz.  Distributed Enumeration , 1997, Inf. Process. Lett..

[26]  Yves Métivier,et al.  Different local controls for graph relabeling systems , 2005, Mathematical systems theory.

[27]  Yves Métivier,et al.  Graph relabelling systems and distributed algorithms , 1999 .

[28]  Yves Métivier,et al.  Termination detection and universal graph reconstruction , 2000, SIROCCO.

[29]  Laurence Pierre,et al.  Formal Proof of Applications Distributed in Symmetric Interconnection Networks , 2003, Parallel Process. Lett..

[30]  Yves Métivier,et al.  Local Terminations and Distributed Computability in Anonymous Networks , 2008, DISC.

[31]  Gruia-Catalin Roman,et al.  Modeling mobile IP in mobile UNITY , 1999, TSEM.

[32]  Yuxin Deng,et al.  Verifying Self-stabilizing Population Protocols with Coq , 2009, 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering.

[33]  Michel Bauderon,et al.  A Unified Framework for Designing, Implementing and Visualizing Distributed Algorithms , 2003, GT-VMT@ICGT.

[34]  Ching-Tsun Chou,et al.  Mechanical Verification of Distributed Algorithms in Higher-Order Logic , 1994, Comput. J..

[35]  Wan Fokkink,et al.  Modelling Distributed Systems , 2010, Texts in Theoretical Computer Science. An EATCS Series.

[36]  Sandrine Blazy,et al.  Vérification formelle d'un algorithme d'allocation de registres par coloration de graphe , 2008 .

[37]  Arnaud Casteigts.  Contribution à l'algorithmique distribuée dans les réseaux mobiles ad hoc - Calculs locaux et réétiquetages de graphes dynamiques. (Distributed algorithmics in mobile ad hoc networks - Local computations and dynamic graph relabelling systems) , 2007 .