Lazy Caching in TLA
Identifieur interne : 002E46 ( Hal/Curation ); précédent : 002E45; suivant : 002E47Lazy Caching in TLA
Auteurs : Peter Ladkin ; Leslie Lamport ; Bryan Olivier ; Denis Roegel [France]Source :
- Distributed Computing [ 0178-2770 ] ; 1999.
English descriptors
- mix :
Abstract
We address the problem, proposed by Gerth, of verifying that a simplified version of the lazy caching algorithm of Afek, Brown, and Merritt is sequentially consistent. We specify the algorithm and sequential consistency in TLA+, a formal specification language based on TLA (the Temporal Logic of Actions). We then describe how to construct and check a formal TLA correctness proof.
Url:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002E46
Links to Exploration step
Hal:inria-00098997Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Lazy Caching in TLA</title><author><name sortKey="Ladkin, Peter" sort="Ladkin, Peter" uniqKey="Ladkin P" first="Peter" last="Ladkin">Peter Ladkin</name></author><author><name sortKey="Lamport, Leslie" sort="Lamport, Leslie" uniqKey="Lamport L" first="Leslie" last="Lamport">Leslie Lamport</name></author><author><name sortKey="Olivier, Bryan" sort="Olivier, Bryan" uniqKey="Olivier B" first="Bryan" last="Olivier">Bryan Olivier</name></author><author><name sortKey="Roegel, Denis" sort="Roegel, Denis" uniqKey="Roegel D" first="Denis" last="Roegel">Denis Roegel</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-23092" status="OLD"><orgName>MODEL (Méthodes formelles et applications)</orgName><orgName type="acronym">MODEL</orgName><desc><address><country key="FR"></country></address></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><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:inria-00098997</idno><idno type="halId">inria-00098997</idno><idno type="halUri">https://hal.inria.fr/inria-00098997</idno><idno type="url">https://hal.inria.fr/inria-00098997</idno><date when="1999">1999</date><idno type="wicri:Area/Hal/Corpus">002E46</idno><idno type="wicri:Area/Hal/Curation">002E46</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Lazy Caching in TLA</title><author><name sortKey="Ladkin, Peter" sort="Ladkin, Peter" uniqKey="Ladkin P" first="Peter" last="Ladkin">Peter Ladkin</name></author><author><name sortKey="Lamport, Leslie" sort="Lamport, Leslie" uniqKey="Lamport L" first="Leslie" last="Lamport">Leslie Lamport</name></author><author><name sortKey="Olivier, Bryan" sort="Olivier, Bryan" uniqKey="Olivier B" first="Bryan" last="Olivier">Bryan Olivier</name></author><author><name sortKey="Roegel, Denis" sort="Roegel, Denis" uniqKey="Roegel D" first="Denis" last="Roegel">Denis Roegel</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-23092" status="OLD"><orgName>MODEL (Méthodes formelles et applications)</orgName><orgName type="acronym">MODEL</orgName><desc><address><country key="FR"></country></address></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><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><series><title level="j">Distributed Computing</title><idno type="ISSN">0178-2770</idno><imprint><date type="datePub">1999</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>algorithm</term><term>algorithme</term><term>correction</term><term>lazy caching</term><term>verification</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">We address the problem, proposed by Gerth, of verifying that a simplified version of the lazy caching algorithm of Afek, Brown, and Merritt is sequentially consistent. We specify the algorithm and sequential consistency in TLA+, a formal specification language based on TLA (the Temporal Logic of Actions). We then describe how to construct and check a formal TLA correctness proof.</div></front></TEI><hal api="V3"><titleStmt><title xml:lang="en">Lazy Caching in TLA</title><author role="aut"><persName><forename type="first">Peter</forename><surname>Ladkin</surname></persName><email></email><idno type="halauthor">130189</idno><orgName ref="#struct-61197"></orgName></author><author role="aut"><persName><forename type="first">Leslie</forename><surname>Lamport</surname></persName><email>lamport@pa.dec.com</email><idno type="halauthor">130190</idno><orgName ref="#struct-364607"></orgName></author><author role="aut"><persName><forename type="first">Bryan</forename><surname>Olivier</surname></persName><email></email><idno type="halauthor">130191</idno></author><author role="aut"><persName><forename type="first">Denis</forename><surname>Roegel</surname></persName><email></email><idno type="idhal">denisroegel</idno><idno type="halauthor">208453</idno><orgName ref="#struct-300292"></orgName><affiliation ref="#struct-23092"></affiliation></author><editor role="depositor"><persName><forename>Publications</forename><surname>Loria</surname></persName><email>publications@loria.fr</email></editor></titleStmt><editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2006-09-26 08:41:03</date><date type="whenModified">2016-05-19 01:04:46</date><date type="whenReleased">2006-09-28 15:22:45</date><date type="whenProduced">1999</date></edition><respStmt><resp>contributor</resp><name key="108626"><persName><forename>Publications</forename><surname>Loria</surname></persName><email>publications@loria.fr</email></name></respStmt></editionStmt><publicationStmt><distributor>CCSD</distributor><idno type="halId">inria-00098997</idno><idno type="halUri">https://hal.inria.fr/inria-00098997</idno><idno type="halBibtex">ladkin:inria-00098997</idno><idno type="halRefHtml">Distributed Computing, Springer Verlag, 1999, 12 (2-3), pp.151-174</idno><idno type="halRef">Distributed Computing, Springer Verlag, 1999, 12 (2-3), pp.151-174</idno></publicationStmt><seriesStmt><idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno><idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno><idno type="stamp" n="LORIA2">Publications du LORIA</idno><idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno><idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno><idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno></seriesStmt><notesStmt><note type="commentary">Article dans revue scientifique avec comité de lecture.</note><note type="audience" n="1">Not set</note><note type="popular" n="0">No</note><note type="peer" n="1">Yes</note></notesStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Lazy Caching in TLA</title><author role="aut"><persName><forename type="first">Peter</forename><surname>Ladkin</surname></persName><idno type="halAuthorId">130189</idno><orgName ref="#struct-61197"></orgName></author><author role="aut"><persName><forename type="first">Leslie</forename><surname>Lamport</surname></persName><email>lamport@pa.dec.com</email><idno type="halAuthorId">130190</idno><orgName ref="#struct-364607"></orgName></author><author role="aut"><persName><forename type="first">Bryan</forename><surname>Olivier</surname></persName><idno type="halAuthorId">130191</idno></author><author role="aut"><persName><forename type="first">Denis</forename><surname>Roegel</surname></persName><idno type="idHal">denisroegel</idno><idno type="halAuthorId">208453</idno><orgName ref="#struct-300292"></orgName><affiliation ref="#struct-23092"></affiliation></author></analytic><monogr><idno type="localRef">99-R-135 || ladkin99a</idno><idno type="halJournalId" status="VALID">12635</idno><idno type="issn">0178-2770</idno><idno type="eissn">1432-0452</idno><title level="j">Distributed Computing</title><imprint><publisher>Springer Verlag</publisher><biblScope unit="volume">12</biblScope><biblScope unit="issue">2-3</biblScope><biblScope unit="pp">151-174</biblScope><date type="datePub">1999</date></imprint></monogr></biblStruct></sourceDesc><profileDesc><langUsage><language ident="en">English</language></langUsage><textClass><keywords scheme="author"><term xml:lang="en">verification</term><term xml:lang="en">algorithm</term><term xml:lang="en">correction</term><term xml:lang="en">algorithme</term><term xml:lang="en">lazy caching</term></keywords><classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode><classCode scheme="halTypology" n="ART">Journal articles</classCode></textClass><abstract xml:lang="en">We address the problem, proposed by Gerth, of verifying that a simplified version of the lazy caching algorithm of Afek, Brown, and Merritt is sequentially consistent. We specify the algorithm and sequential consistency in TLA+, a formal specification language based on TLA (the Temporal Logic of Actions). We then describe how to construct and check a formal TLA correctness proof.</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 002E46 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Hal/Curation/biblio.hfd -nk 002E46 | 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:inria-00098997
|texte= Lazy Caching in TLA
}}
| This area was generated with Dilib version V0.6.33. |  |