Refinement-based Verification of Local Synchronization Algorithms
Identifieur interne : 004058 ( Hal/Curation ); précédent : 004057; suivant : 004059Refinement-based Verification of Local Synchronization Algorithms
Auteurs : Dominique Méry [France] ; Mohamed Mosbah [France] ; Mohamed Tounsi [France]Source :
English descriptors
- mix :
Abstract
Synchronization algorithms are mandatory for simulating local computation models of distributed algorithms. Therefore, correctness of these algorithms becomes crucial, because it gives confidence that local computations are simulated as designed and do not behave harmfully. However, these algorithms are considered to be very complex to prove since they are integrating both distributed and probabilistic aspects. We derive proofs of synchronization algorithms relied upon the correct-by-construction paradigm; it is supported by a progressive and incremental process controlled by the refinement techniques. We illustrate our approach by examples like the Handshake and the LC1 algorithms. These algorithms are designed for an asynchronous distributed network of anonymous processes which use the message-passing feature as a model for the communication.
Url:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :004058
Links to Exploration step
Hal:hal-00579252Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Refinement-based Verification of Local Synchronization Algorithms</title>
<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>
<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="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>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00579252</idno>
<idno type="halId">hal-00579252</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-00579252</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-00579252</idno>
<date when="2011-06-20">2011-06-20</date>
<idno type="wicri:Area/Hal/Corpus">004058</idno>
<idno type="wicri:Area/Hal/Curation">004058</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Refinement-based Verification of Local Synchronization Algorithms</title>
<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>
<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="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>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Event-B</term>
<term>Formal methods</term>
<term>Probabilistic distributed algorithm</term>
<term>Synchronization algorithm</term>
<term>Visidia</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Synchronization algorithms are mandatory for simulating local computation models of distributed algorithms. Therefore, correctness of these algorithms becomes crucial, because it gives confidence that local computations are simulated as designed and do not behave harmfully. However, these algorithms are considered to be very complex to prove since they are integrating both distributed and probabilistic aspects. We derive proofs of synchronization algorithms relied upon the correct-by-construction paradigm; it is supported by a progressive and incremental process controlled by the refinement techniques. We illustrate our approach by examples like the Handshake and the LC1 algorithms. These algorithms are designed for an asynchronous distributed network of anonymous processes which use the message-passing feature as a model for the communication.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Refinement-based Verification of Local Synchronization Algorithms</title>
<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>
<author role="aut"><persName><forename type="first">Mohamed</forename>
<surname>Mosbah</surname>
</persName>
<email>mosbah@labri.fr</email>
<idno type="halauthor">332759</idno>
<affiliation ref="#struct-3102"></affiliation>
</author>
<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>
<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-03-23 12:27:36</date>
<date type="whenWritten">2011-04-04</date>
<date type="whenModified">2016-05-19 01:04:40</date>
<date type="whenReleased">2011-03-23 12:27:36</date>
<date type="whenProduced">2011-06-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-00579252</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-00579252</idno>
<idno type="halBibtex">mery:hal-00579252</idno>
<idno type="halRefHtml">17TH INTERNATIONAL SYMPOSIUM ON FORMAL METHODS, Jun 2011, Limerick, Ireland. Springer, à paraître, 2011, Lecture Notes in Computer Science</idno>
<idno type="halRef">17TH INTERNATIONAL SYMPOSIUM ON FORMAL METHODS, Jun 2011, Limerick, Ireland. Springer, à paraître, 2011, Lecture Notes in Computer Science</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">Refinement-based Verification of Local Synchronization Algorithms</title>
<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>
<author role="aut"><persName><forename type="first">Mohamed</forename>
<surname>Mosbah</surname>
</persName>
<email>mosbah@labri.fr</email>
<idno type="halAuthorId">332759</idno>
<affiliation ref="#struct-3102"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Mohamed</forename>
<surname>Tounsi</surname>
</persName>
<idno type="halAuthorId">386676</idno>
<affiliation ref="#struct-3102"></affiliation>
</author>
</analytic>
<monogr><title level="m">Formal Methods FM2011</title>
<meeting><title>17TH INTERNATIONAL SYMPOSIUM ON FORMAL METHODS</title>
<date type="start">2011-06-20</date>
<date type="end">2011-06-24</date>
<settlement>Limerick</settlement>
<country key="IE">Ireland</country>
</meeting>
<imprint><publisher>Springer</publisher>
<biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
<biblScope unit="pp">à paraître</biblScope>
<date type="datePub">2011-06-20</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">Synchronization algorithm</term>
<term xml:lang="en">Probabilistic distributed algorithm</term>
<term xml:lang="en">Formal methods</term>
<term xml:lang="en">Event-B</term>
<term xml:lang="en">Visidia</term>
</keywords>
<classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
<classCode scheme="halDomain" n="info.info-se">Computer Science [cs]/Software Engineering [cs.SE]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Synchronization algorithms are mandatory for simulating local computation models of distributed algorithms. Therefore, correctness of these algorithms becomes crucial, because it gives confidence that local computations are simulated as designed and do not behave harmfully. However, these algorithms are considered to be very complex to prove since they are integrating both distributed and probabilistic aspects. We derive proofs of synchronization algorithms relied upon the correct-by-construction paradigm; it is supported by a progressive and incremental process controlled by the refinement techniques. We illustrate our approach by examples like the Handshake and the LC1 algorithms. These algorithms are designed for an asynchronous distributed network of anonymous processes which use the message-passing feature as a model for the communication.</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 004058 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 004058 | 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-00579252 |texte= Refinement-based Verification of Local Synchronization Algorithms }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |