InforLorV4, Hal, Curation, bibRecord, 003E41

Proving Distributed Algorithms by Combining Reﬁnement and Local Computations

Identifieur interne : 003E41 ( Hal/Curation ); précédent : 003E40; suivant : 003E42

Proving Distributed Algorithms by Combining Reﬁnement and Local Computations

Auteurs : Mohamed Tounsi [France] ; Mohamed Mosbah [France] ; Dominique Méry [France]

Source :

RBID : Hal:hal-00644187

English descriptors

mix :
- Event-B, Local computations, Proof-based pattern, distributed algorithms.

Abstract

Distributed algorithms are considered to be very complex to design and to prove; our paper contributes to the design of correct-by-construction distributed algorithms. The main idea relies upon the development of distributed algorithms following a top/down approach, which is clearly well known in earlier works of Dijkstra, and to use refinement for proving the correctness of the resulting algorithms. However, the link between the problem and the first model remains to be expressed and the refinement is a real help to justify in a very progressive way the choices of design. We propose in this work a framework combining local computations models and refinement to prove the correctness of a large class of distributed algorithms. Local computations models define abstract computing processes for solving problems by distributed algorithms and can be integrated into a the Event-B modelling language to define proof-based patterns for the design of distributed algorithms. We illustrate our approach by examples like the leader election protocol or the distributed coloring algorithm. Our proposal is integrated into an environment called ViSiDiA.

Url:

https://hal.archives-ouvertes.fr/hal-00644187

Links toward previous steps (curation, corpus...)

to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003E41

Links to Exploration step

Hal:hal-00644187

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Proving Distributed Algorithms by Combining Reﬁnement and Local Computations</title>
<author><name sortKey="Tounsi, Mohamed" sort="Tounsi, Mohamed" uniqKey="Tounsi M" first="Mohamed" last="Tounsi">Mohamed Tounsi</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-3102" status="VALID"><orgName>Laboratoire Bordelais de Recherche en Informatique</orgName>
<orgName type="acronym">LaBRI</orgName>
<desc><address><addrLine>Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.labri.fr</ref>
</desc>
<listRelation><relation active="#struct-91134" type="direct"></relation>
<relation active="#struct-92972" type="direct"></relation>
<relation active="#struct-300366" type="direct"></relation>
<relation name="UMR5800" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-91134" type="direct"><org type="institution" xml:id="struct-91134" status="OLD"><orgName>Université Bordeaux Segalen - Bordeaux 2</orgName>
<desc><address><addrLine>146 rue Léo Saignat - 33076 Bordeaux cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-bordeauxsegalen.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-92972" type="direct"><org type="institution" xml:id="struct-92972" status="OLD"><orgName>Université Sciences et Technologies - Bordeaux 1</orgName>
<desc><address><addrLine>351 cours de la Libération - 33405 Talence cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.u-bordeaux1.fr</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300366" type="direct"><org type="institution" xml:id="struct-300366" status="VALID"><orgName>École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR5800" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Mosbah, Mohamed" sort="Mosbah, Mohamed" uniqKey="Mosbah M" first="Mohamed" last="Mosbah">Mohamed Mosbah</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-3102" status="VALID"><orgName>Laboratoire Bordelais de Recherche en Informatique</orgName>
<orgName type="acronym">LaBRI</orgName>
<desc><address><addrLine>Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.labri.fr</ref>
</desc>
<listRelation><relation active="#struct-91134" type="direct"></relation>
<relation active="#struct-92972" type="direct"></relation>
<relation active="#struct-300366" type="direct"></relation>
<relation name="UMR5800" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-91134" type="direct"><org type="institution" xml:id="struct-91134" status="OLD"><orgName>Université Bordeaux Segalen - Bordeaux 2</orgName>
<desc><address><addrLine>146 rue Léo Saignat - 33076 Bordeaux cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-bordeauxsegalen.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-92972" type="direct"><org type="institution" xml:id="struct-92972" status="OLD"><orgName>Université Sciences et Technologies - Bordeaux 1</orgName>
<desc><address><addrLine>351 cours de la Libération - 33405 Talence cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.u-bordeaux1.fr</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300366" type="direct"><org type="institution" xml:id="struct-300366" status="VALID"><orgName>École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR5800" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Méry">Dominique Méry</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-140234" status="OLD"><orgName>Proof-oriented development of computer-based systems</orgName>
<orgName type="acronym">MOSEL</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://mosel.loria.fr/</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00644187</idno>
<idno type="halId">hal-00644187</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-00644187</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-00644187</idno>
<date when="2011-11-20">2011-11-20</date>
<idno type="wicri:Area/Hal/Corpus">003E41</idno>
<idno type="wicri:Area/Hal/Curation">003E41</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Proving Distributed Algorithms by Combining Reﬁnement and Local Computations</title>
<author><name sortKey="Tounsi, Mohamed" sort="Tounsi, Mohamed" uniqKey="Tounsi M" first="Mohamed" last="Tounsi">Mohamed Tounsi</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-3102" status="VALID"><orgName>Laboratoire Bordelais de Recherche en Informatique</orgName>
<orgName type="acronym">LaBRI</orgName>
<desc><address><addrLine>Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.labri.fr</ref>
</desc>
<listRelation><relation active="#struct-91134" type="direct"></relation>
<relation active="#struct-92972" type="direct"></relation>
<relation active="#struct-300366" type="direct"></relation>
<relation name="UMR5800" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-91134" type="direct"><org type="institution" xml:id="struct-91134" status="OLD"><orgName>Université Bordeaux Segalen - Bordeaux 2</orgName>
<desc><address><addrLine>146 rue Léo Saignat - 33076 Bordeaux cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-bordeauxsegalen.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-92972" type="direct"><org type="institution" xml:id="struct-92972" status="OLD"><orgName>Université Sciences et Technologies - Bordeaux 1</orgName>
<desc><address><addrLine>351 cours de la Libération - 33405 Talence cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.u-bordeaux1.fr</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300366" type="direct"><org type="institution" xml:id="struct-300366" status="VALID"><orgName>École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR5800" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Mosbah, Mohamed" sort="Mosbah, Mohamed" uniqKey="Mosbah M" first="Mohamed" last="Mosbah">Mohamed Mosbah</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-3102" status="VALID"><orgName>Laboratoire Bordelais de Recherche en Informatique</orgName>
<orgName type="acronym">LaBRI</orgName>
<desc><address><addrLine>Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.labri.fr</ref>
</desc>
<listRelation><relation active="#struct-91134" type="direct"></relation>
<relation active="#struct-92972" type="direct"></relation>
<relation active="#struct-300366" type="direct"></relation>
<relation name="UMR5800" active="#struct-441569" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-91134" type="direct"><org type="institution" xml:id="struct-91134" status="OLD"><orgName>Université Bordeaux Segalen - Bordeaux 2</orgName>
<desc><address><addrLine>146 rue Léo Saignat - 33076 Bordeaux cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-bordeauxsegalen.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-92972" type="direct"><org type="institution" xml:id="struct-92972" status="OLD"><orgName>Université Sciences et Technologies - Bordeaux 1</orgName>
<desc><address><addrLine>351 cours de la Libération - 33405 Talence cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.u-bordeaux1.fr</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300366" type="direct"><org type="institution" xml:id="struct-300366" status="VALID"><orgName>École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle name="UMR5800" active="#struct-441569" type="direct"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
</affiliation>
</author>
<author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Méry">Dominique Méry</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-140234" status="OLD"><orgName>Proof-oriented development of computer-based systems</orgName>
<orgName type="acronym">MOSEL</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://mosel.loria.fr/</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Event-B</term>
<term>Local computations</term>
<term>Proof-based pattern</term>
<term>distributed algorithms</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Distributed algorithms are considered to be very complex to design and to prove; our paper contributes to the design of correct-by-construction distributed algorithms. The main idea relies upon the development of distributed algorithms following a top/down approach, which is clearly well known in earlier works of Dijkstra, and to use refinement for proving the correctness of the resulting algorithms. However, the link between the problem and the first model remains to be expressed and the refinement is a real help to justify in a very progressive way the choices of design. We propose in this work a framework combining local computations models and refinement to prove the correctness of a large class of distributed algorithms. Local computations models define abstract computing processes for solving problems by distributed algorithms and can be integrated into a the Event-B modelling language to define proof-based patterns for the design of distributed algorithms. We illustrate our approach by examples like the leader election protocol or the distributed coloring algorithm. Our proposal is integrated into an environment called ViSiDiA.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Proving Distributed Algorithms by Combining Reﬁnement and Local Computations</title>
<author role="aut"><persName><forename type="first">Mohamed</forename>
<surname>Tounsi</surname>
</persName>
<email></email>
<idno type="halauthor">386676</idno>
<affiliation ref="#struct-3102"></affiliation>
</author>
<author role="crp"><persName><forename type="first">Mohamed</forename>
<surname>Mosbah</surname>
</persName>
<email>mosbah@labri.fr</email>
<ptr type="url" target="http://www.labri.fr/~mosbah/"></ptr>
<idno type="halauthor">662046</idno>
<affiliation ref="#struct-3102"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Dominique</forename>
<surname>Méry</surname>
</persName>
<email>mery@loria.fr</email>
<idno type="idhal">dominiquemery</idno>
<idno type="halauthor">58156</idno>
<affiliation ref="#struct-140234"></affiliation>
</author>
<editor role="depositor"><persName><forename>Mohamed</forename>
<surname>Mosbah</surname>
</persName>
<email>mosbah@labri.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2011-11-23 17:42:50</date>
<date type="whenWritten">2011-10-13</date>
<date type="whenModified">2016-05-19 01:04:32</date>
<date type="whenReleased">2011-11-23 17:42:50</date>
<date type="whenProduced">2011-11-20</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="129128"><persName><forename>Mohamed</forename>
<surname>Mosbah</surname>
</persName>
<email>mosbah@labri.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-00644187</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-00644187</idno>
<idno type="halBibtex">tounsi:hal-00644187</idno>
<idno type="halRefHtml">Electronic Communications of the EASST, 2011, 35, pp.ISSN 1863-2122</idno>
<idno type="halRef">Electronic Communications of the EASST, 2011, 35, pp.ISSN 1863-2122</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="ENSEIRB">Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux</idno>
<idno type="stamp" n="LABRI">Laboratoire Bordelais de Recherche en Informatique</idno>
<idno type="stamp" n="UNIV-BORDEAUX">Université de Bordeaux</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
<idno type="stamp" n="LORIA-FM" p="LORIA">Méthodes formelles</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="TESTBORDEAUX">TESTBORDEAUX</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Proving Distributed Algorithms by Combining Reﬁnement and Local Computations</title>
<author role="aut"><persName><forename type="first">Mohamed</forename>
<surname>Tounsi</surname>
</persName>
<idno type="halAuthorId">386676</idno>
<affiliation ref="#struct-3102"></affiliation>
</author>
<author role="crp"><persName><forename type="first">Mohamed</forename>
<surname>Mosbah</surname>
</persName>
<email>mosbah@labri.fr</email>
<ptr type="url" target="http://www.labri.fr/~mosbah/"></ptr>
<idno type="halAuthorId">662046</idno>
<affiliation ref="#struct-3102"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Dominique</forename>
<surname>Méry</surname>
</persName>
<email>mery@loria.fr</email>
<idno type="idHal">dominiquemery</idno>
<idno type="halAuthorId">58156</idno>
<affiliation ref="#struct-140234"></affiliation>
</author>
</analytic>
<monogr><idno type="halJournalId" status="INCOMING">57302</idno>
<title level="j">Electronic Communications of the EASST</title>
<imprint><biblScope unit="volume">35</biblScope>
<biblScope unit="pp">ISSN 1863-2122</biblScope>
<date type="datePub">2011-11-20</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">Local computations</term>
<term xml:lang="en">distributed algorithms</term>
<term xml:lang="en">Proof-based pattern</term>
<term xml:lang="en">Event-B</term>
</keywords>
<classCode scheme="classification">F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS</classCode>
<classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">Distributed algorithms are considered to be very complex to design and to prove; our paper contributes to the design of correct-by-construction distributed algorithms. The main idea relies upon the development of distributed algorithms following a top/down approach, which is clearly well known in earlier works of Dijkstra, and to use refinement for proving the correctness of the resulting algorithms. However, the link between the problem and the first model remains to be expressed and the refinement is a real help to justify in a very progressive way the choices of design. We propose in this work a framework combining local computations models and refinement to prove the correctness of a large class of distributed algorithms. Local computations models define abstract computing processes for solving problems by distributed algorithms and can be integrated into a the Event-B modelling language to define proof-based patterns for the design of distributed algorithms. We illustrate our approach by examples like the leader election protocol or the distributed coloring algorithm. Our proposal is integrated into an environment called ViSiDiA.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Curation

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003E41 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 003E41 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Curation
   |type=    RBID
   |clé=     Hal:hal-00644187
   |texte=   Proving Distributed Algorithms by Combining Reﬁnement and Local Computations
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Proving Distributed Algorithms by Combining Reﬁnement and Local Computations

Proving Distributed Algorithms by Combining Reﬁnement and Local Computations

Source :

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri