Symbolic Model-Checking of Optimistic Replication Algorithms
Identifieur interne : 003073 ( Main/Merge ); précédent : 003072; suivant : 003074Symbolic Model-Checking of Optimistic Replication Algorithms
Auteurs : Hanifa Boucheneb [Canada] ; Abdessamad Imine [France] ; Manal Najem [Canada]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The Operational Transformation (OT) approach, used in many collaborative editors, allows a group of users to concurrently update replicas of a shared object and exchange their updates in any order. The basic idea of this approach is to transform any received update operation before its execution on a replica of the object. This transformation aims to ensure the convergence of the different replicas of the object. However, designing transformation algorithms for achieving convergence is a critical and challenging issue. In this paper, we address the verification of OT algorithms with a symbolic model-checking technique. We show how to use the difference bound matrices to explore symbolically infinite state-spaces of such systems and provide symbolic counterexamples for the convergence property.
Url:
DOI: 10.1007/978-3-642-16265-7_8
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001994
- to stream Istex, to step Curation: 001974
- to stream Istex, to step Checkpoint: 000778
Links to Exploration step
ISTEX:6F51BF13E53C6CBEBFAE89DFA013CDB15428294DLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Symbolic Model-Checking of Optimistic Replication Algorithms</title><author><name sortKey="Boucheneb, Hanifa" sort="Boucheneb, Hanifa" uniqKey="Boucheneb H" first="Hanifa" last="Boucheneb">Hanifa Boucheneb</name></author><author><name sortKey="Imine, Abdessamad" sort="Imine, Abdessamad" uniqKey="Imine A" first="Abdessamad" last="Imine">Abdessamad Imine</name></author><author><name sortKey="Najem, Manal" sort="Najem, Manal" uniqKey="Najem M" first="Manal" last="Najem">Manal Najem</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:6F51BF13E53C6CBEBFAE89DFA013CDB15428294D</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-16265-7_8</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-R71QXV51-N/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001994</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001994</idno><idno type="wicri:Area/Istex/Curation">001974</idno><idno type="wicri:Area/Istex/Checkpoint">000778</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000778</idno><idno type="wicri:doubleKey">0302-9743:2010:Boucheneb H:symbolic:model:checking</idno><idno type="wicri:Area/Main/Merge">003073</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Symbolic Model-Checking of Optimistic Replication Algorithms</title><author><name sortKey="Boucheneb, Hanifa" sort="Boucheneb, Hanifa" uniqKey="Boucheneb H" first="Hanifa" last="Boucheneb">Hanifa Boucheneb</name><affiliation wicri:level="1"><country xml:lang="fr">Canada</country><wicri:regionArea>Laboratoire VeriForm, Department of Computer Engineering, École Polytechnique de Montréal, Station Centre-ville, P.O. Box 6079, H3C 3A7, Montréal, Québec</wicri:regionArea><wicri:noRegion>Québec</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Canada</country></affiliation></author><author><name sortKey="Imine, Abdessamad" sort="Imine, Abdessamad" uniqKey="Imine A" first="Abdessamad" last="Imine">Abdessamad Imine</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>INRIA Grand-Est & Nancy-Université</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Najem, Manal" sort="Najem, Manal" uniqKey="Najem M" first="Manal" last="Najem">Manal Najem</name><affiliation wicri:level="1"><country xml:lang="fr">Canada</country><wicri:regionArea>Laboratoire VeriForm, Department of Computer Engineering, École Polytechnique de Montréal, Station Centre-ville, P.O. Box 6079, H3C 3A7, Montréal, Québec</wicri:regionArea><wicri:noRegion>Québec</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The Operational Transformation (OT) approach, used in many collaborative editors, allows a group of users to concurrently update replicas of a shared object and exchange their updates in any order. The basic idea of this approach is to transform any received update operation before its execution on a replica of the object. This transformation aims to ensure the convergence of the different replicas of the object. However, designing transformation algorithms for achieving convergence is a critical and challenging issue. In this paper, we address the verification of OT algorithms with a symbolic model-checking technique. We show how to use the difference bound matrices to explore symbolically infinite state-spaces of such systems and provide symbolic counterexamples for the convergence property.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003073 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 003073 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:6F51BF13E53C6CBEBFAE89DFA013CDB15428294D
|texte= Symbolic Model-Checking of Optimistic Replication Algorithms
}}
| This area was generated with Dilib version V0.6.33. |  |