Proving Distributed Algorithms by Combining Refinement and Local Computations
Identifieur interne : 003E40 ( Hal/Corpus ); précédent : 003E39; suivant : 003E41Proving Distributed Algorithms by Combining Refinement and Local Computations
Auteurs : Dominique Méry ; Mohammed Mosbah ; Mohammed TounsiSource :
English descriptors
- mix :
Abstract
Abstract: Our approach is directly related to the design of correct-by-construction programs. The main idea relies upon the development of distributed algorithms fol- lowing a top/down approach, which is clearly well known in earlier works of Dijkstra, and to use the refinement for controlling the correctness of the resulting algorithm. It relies on a more fundamental question related to the notion of problem to solve. The methodology can be based on incremental proof-based developments. However, the link between the problem and the first model remains to be expressed and the refine- ment 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 and refinement to prove the correctness of a large class of distributed algorithms.
Url:
Links to Exploration step
Hal:inria-00547302Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Proving Distributed Algorithms by Combining Refinement and Local Computations</title>
<author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Méry">Dominique Méry</name>
<affiliation><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="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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>
</affiliation>
</author>
<author><name sortKey="Mosbah, Mohammed" sort="Mosbah, Mohammed" uniqKey="Mosbah M" first="Mohammed" last="Mosbah">Mohammed Mosbah</name>
<affiliation><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="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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>
</affiliation>
</author>
<author><name sortKey="Tounsi, Mohammed" sort="Tounsi, Mohammed" uniqKey="Tounsi M" first="Mohammed" last="Tounsi">Mohammed Tounsi</name>
<affiliation><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="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00547302</idno>
<idno type="halId">inria-00547302</idno>
<idno type="halUri">https://hal.inria.fr/inria-00547302</idno>
<idno type="url">https://hal.inria.fr/inria-00547302</idno>
<date when="2010-09-21">2010-09-21</date>
<idno type="wicri:Area/Hal/Corpus">003E40</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Proving Distributed Algorithms by Combining Refinement and Local Computations</title>
<author><name sortKey="Mery, Dominique" sort="Mery, Dominique" uniqKey="Mery D" first="Dominique" last="Méry">Dominique Méry</name>
<affiliation><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="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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>
</affiliation>
</author>
<author><name sortKey="Mosbah, Mohammed" sort="Mosbah, Mohammed" uniqKey="Mosbah M" first="Mohammed" last="Mosbah">Mohammed Mosbah</name>
<affiliation><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="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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>
</affiliation>
</author>
<author><name sortKey="Tounsi, Mohammed" sort="Tounsi, Mohammed" uniqKey="Tounsi M" first="Mohammed" last="Tounsi">Mohammed Tounsi</name>
<affiliation><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="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</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>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Distributed algorithm</term>
<term>Distributed algorithm.</term>
<term>Event-B</term>
<term>Local computation</term>
<term>Proof-based pattern</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Our approach is directly related to the design of correct-by-construction programs. The main idea relies upon the development of distributed algorithms fol- lowing a top/down approach, which is clearly well known in earlier works of Dijkstra, and to use the refinement for controlling the correctness of the resulting algorithm. It relies on a more fundamental question related to the notion of problem to solve. The methodology can be based on incremental proof-based developments. However, the link between the problem and the first model remains to be expressed and the refine- ment 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 and refinement to prove the correctness of a large class of distributed algorithms.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Proving Distributed Algorithms by Combining Refinement and Local Computations</title>
<author role="crp"><persName><forename type="first">Dominique</forename>
<surname>Méry</surname>
</persName>
<email>Dominique.Mery@loria.fr</email>
<idno type="idhal">dominiquemery</idno>
<idno type="halauthor">122707</idno>
<orgName ref="#struct-300291"></orgName>
<affiliation ref="#struct-140234"></affiliation>
</author>
<author role="crp"><persName><forename type="first">Mohammed</forename>
<surname>Mosbah</surname>
</persName>
<email>mosbah@labri.fr</email>
<idno type="halauthor">557910</idno>
<orgName ref="#struct-366532"></orgName>
<affiliation ref="#struct-3102"></affiliation>
<affiliation ref="#struct-27658"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Mohammed</forename>
<surname>Tounsi</surname>
</persName>
<email>tounsi@labri.fr</email>
<idno type="halauthor">557911</idno>
<orgName ref="#struct-92972"></orgName>
<affiliation ref="#struct-3102"></affiliation>
</author>
<editor role="depositor"><persName><forename>Dominique</forename>
<surname>Méry</surname>
</persName>
<email>dominique.mery@loria.fr</email>
</editor>
<funder ref="#projanr-2508"></funder>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2010-12-15 22:47:54</date>
<date type="whenWritten">2010-09-21</date>
<date type="whenModified">2016-05-19 01:04:34</date>
<date type="whenReleased">2010-12-15 22:47:54</date>
<date type="whenProduced">2010-09-21</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="107371"><persName><forename>Dominique</forename>
<surname>Méry</surname>
</persName>
<email>dominique.mery@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00547302</idno>
<idno type="halUri">https://hal.inria.fr/inria-00547302</idno>
<idno type="halBibtex">mery:inria-00547302</idno>
<idno type="halRefHtml">Jens Bendisposto, Michael Leuschel, Markus Roggenbach. AVOCS 2010 10th International Workshop on Automated Verification of Critical Systems, Sep 2010, Dusseldorf, Germany. 2010</idno>
<idno type="halRef">Jens Bendisposto, Michael Leuschel, Markus Roggenbach. AVOCS 2010 10th International Workshop on Automated Verification of Critical Systems, Sep 2010, Dusseldorf, Germany. 2010</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="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="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</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="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Proving Distributed Algorithms by Combining Refinement and Local Computations</title>
<author role="crp"><persName><forename type="first">Dominique</forename>
<surname>Méry</surname>
</persName>
<email>Dominique.Mery@loria.fr</email>
<idno type="idHal">dominiquemery</idno>
<idno type="halAuthorId">122707</idno>
<orgName ref="#struct-300291"></orgName>
<affiliation ref="#struct-140234"></affiliation>
</author>
<author role="crp"><persName><forename type="first">Mohammed</forename>
<surname>Mosbah</surname>
</persName>
<email>mosbah@labri.fr</email>
<idno type="halAuthorId">557910</idno>
<orgName ref="#struct-366532"></orgName>
<affiliation ref="#struct-3102"></affiliation>
<affiliation ref="#struct-27658"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Mohammed</forename>
<surname>Tounsi</surname>
</persName>
<email>tounsi@labri.fr</email>
<idno type="halAuthorId">557911</idno>
<orgName ref="#struct-92972"></orgName>
<affiliation ref="#struct-3102"></affiliation>
</author>
</analytic>
<monogr><meeting><title>AVOCS 2010 10th International Workshop on Automated Verification of Critical Systems</title>
<date type="start">2010-09-21</date>
<date type="end">2010-09-23</date>
<settlement>Dusseldorf</settlement>
<country key="DE">Germany</country>
</meeting>
<editor>Jens Bendisposto, Michael Leuschel, Markus Roggenbach</editor>
<imprint><date type="datePub">2010-09-21</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">Distributed algorithm</term>
<term xml:lang="en">Proof-based pattern</term>
<term xml:lang="en">Event-B</term>
<term xml:lang="en">Local computation</term>
<term xml:lang="en">Distributed algorithm.</term>
</keywords>
<classCode scheme="acm" n="F.3"></classCode>
<classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Abstract: Our approach is directly related to the design of correct-by-construction programs. The main idea relies upon the development of distributed algorithms fol- lowing a top/down approach, which is clearly well known in earlier works of Dijkstra, and to use the refinement for controlling the correctness of the resulting algorithm. It relies on a more fundamental question related to the notion of problem to solve. The methodology can be based on incremental proof-based developments. However, the link between the problem and the first model remains to be expressed and the refine- ment 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 and refinement to prove the correctness of a large class of distributed algorithms.</abstract>
</profileDesc>
</hal>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003E40 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 003E40 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Hal |étape= Corpus |type= RBID |clé= Hal:inria-00547302 |texte= Proving Distributed Algorithms by Combining Refinement and Local Computations }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |