<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01248204</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-17T20:04:20+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Proving Correctness of Highly-Concurrent Linearisable Objects</title>
            <author role="aut">
              <persName>
                <forename type="first">Viktor</forename>
                <surname>Vafeiadis</surname>
              </persName>
              <idno type="halauthorid">142728-0</idno>
              <affiliation ref="#struct-105111"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Maurice</forename>
                <surname>Herlihy</surname>
              </persName>
              <email type="md5">09d81e9d0f5b21303e43ca59c68f4810</email>
              <email type="domain">cs.brown.edu</email>
              <idno type="idhal" notation="numeric">899356</idno>
              <idno type="halauthorid" notation="string">142729-899356</idno>
              <affiliation ref="#struct-30382"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Tony</forename>
                <forename type="middle">Car Hoare</forename>
                <surname>Hoare</surname>
              </persName>
              <idno type="halauthorid">977858-0</idno>
              <affiliation ref="#struct-15503"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Marc</forename>
                <surname>Shapiro</surname>
              </persName>
              <email type="md5">3a9fba80fb97fa40366e556d67d48b36</email>
              <email type="domain">acm.org</email>
              <idno type="idhal" notation="string">shapiro</idno>
              <idno type="idhal" notation="numeric">2384</idno>
              <idno type="halauthorid" notation="string">2120-2384</idno>
              <idno type="IDREF">https://www.idref.fr/068666128</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-8953-9322</idno>
              <idno type="VIAF">https://viaf.org/viaf/200932310</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/AAO-3785-2021</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/AAO-3785-2021</idno>
              <affiliation ref="#struct-2436"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Alain</forename>
                <surname>Monteil</surname>
              </persName>
              <email type="md5">8d58fc1b670b8074dd83e4a4c93d5914</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-12-24 09:43:08</date>
              <date type="whenModified">2026-01-09 22:22:03</date>
              <date type="whenReleased">2015-12-24 10:29:54</date>
              <date type="whenProduced">2006-03-29</date>
              <date type="whenEndEmbargoed">2015-12-24</date>
              <ref type="file" target="https://inria.hal.science/hal-01248204v1/document">
                <date notBefore="2015-12-24"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01248204v1/file/PPoPP-2006-listRG.pdf" id="file-1248204-1326870">
                <date notBefore="2015-12-24"/>
              </ref>
              <ref type="externalLink" target="http://www-sor.inria.fr/~shapiro/papers/PPoPP-2006-listRG.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="102239">
                <persName>
                  <forename>Alain</forename>
                  <surname>Monteil</surname>
                </persName>
                <email type="md5">8d58fc1b670b8074dd83e4a4c93d5914</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01248204</idno>
            <idno type="halUri">https://inria.hal.science/hal-01248204</idno>
            <idno type="halBibtex">vafeiadis:hal-01248204</idno>
            <idno type="halRefHtml">&lt;i&gt;PPoPP 2006 - 11th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming&lt;/i&gt;, Mar 2006, New York, United States. pp.129--136, &lt;a target="_blank" href="https://dx.doi.org/10.1145/1122971.1122992"&gt;&amp;#x27E8;10.1145/1122971.1122992&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">PPoPP 2006 - 11th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Mar 2006, New York, United States. pp.129--136, &amp;#x27E8;10.1145/1122971.1122992&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1248204-1326870"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <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="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="INRIA-ETATSUNIS">Copublications Inria-Etats-Unis</idno>
            <idno type="stamp" n="INRIA-ROYAUMEUNI">INRIA-ROYAUMEUNI</idno>
            <idno type="stamp" n="INRIA-ALLEMAGNE">INRIA-ALLEMAGNE</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 Correctness of Highly-Concurrent Linearisable Objects</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Viktor</forename>
                    <surname>Vafeiadis</surname>
                  </persName>
                  <idno type="halauthorid">142728-0</idno>
                  <affiliation ref="#struct-105111"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Maurice</forename>
                    <surname>Herlihy</surname>
                  </persName>
                  <email type="md5">09d81e9d0f5b21303e43ca59c68f4810</email>
                  <email type="domain">cs.brown.edu</email>
                  <idno type="idhal" notation="numeric">899356</idno>
                  <idno type="halauthorid" notation="string">142729-899356</idno>
                  <affiliation ref="#struct-30382"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Tony</forename>
                    <forename type="middle">Car Hoare</forename>
                    <surname>Hoare</surname>
                  </persName>
                  <idno type="halauthorid">977858-0</idno>
                  <affiliation ref="#struct-15503"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Marc</forename>
                    <surname>Shapiro</surname>
                  </persName>
                  <email type="md5">3a9fba80fb97fa40366e556d67d48b36</email>
                  <email type="domain">acm.org</email>
                  <idno type="idhal" notation="string">shapiro</idno>
                  <idno type="idhal" notation="numeric">2384</idno>
                  <idno type="halauthorid" notation="string">2120-2384</idno>
                  <idno type="IDREF">https://www.idref.fr/068666128</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-8953-9322</idno>
                  <idno type="VIAF">https://viaf.org/viaf/200932310</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/AAO-3785-2021</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/AAO-3785-2021</idno>
                  <affiliation ref="#struct-2436"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>PPoPP 2006 - 11th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming</title>
                  <date type="start">2006-03-29</date>
                  <date type="end">2006-03-31</date>
                  <settlement>New York</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <publisher>ACM</publisher>
                  <biblScope unit="pp">129--136</biblScope>
                  <date type="datePub">2006</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1145/1122971.1122992</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">formel</term>
                <term xml:lang="en">syn</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We study a family of implementations for linked lists using fine-grain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for classical, coarse-grain synchronisation. Our examples are demonstrative of common design patterns such as lock coupling, optimistic, and lazy synchronisation. Although they are are highly concurrent, we prove that they are linearisable, safe, and they correctly implement a high-level abstraction. Our proofs illustrate the power and applicability of rely-guarantee reasoning, as well of some of its limitations. The examples of the paper establish a benchmark challenge for other reasoning techniques.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-105111" status="VALID">
          <idno type="RNSR">201019806P</idno>
          <idno type="ROR">https://ror.org/02pe2kf23</idno>
          <orgName>Max Planck Institute for Software Systems</orgName>
          <orgName type="acronym">MPI-SWS</orgName>
          <desc>
            <address>
              <addrLine>D-66111 Saarbrücken/D-67663 Kaiserslautern</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">http://www.mpi-sws.org</ref>
          </desc>
        </org>
        <org type="regrouplaboratory" xml:id="struct-30382" status="VALID">
          <orgName>Department of Computer Science [Providence]</orgName>
          <desc>
            <address>
              <addrLine>Brown University, Providence, Rhode Island 02912</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">https://cs.brown.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-236317" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-15503" status="VALID">
          <orgName>Microsoft Research [Cambridge]</orgName>
          <orgName type="acronym">Microsoft</orgName>
          <desc>
            <address>
              <addrLine>Roger Needham Building 7 J J Thomson Ave Cambridge CB3 0FB, UK</addrLine>
              <country key="GB"/>
            </address>
            <ref type="url">http://research.microsoft.com/aboutmsr/labs/cambridge/default.aspx</ref>
          </desc>
          <listRelation>
            <relation active="#struct-365620" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-2436" status="OLD">
          <idno type="RNSR">200518313N</idno>
          <orgName>Large-Scale Distributed Systems and Applications</orgName>
          <orgName type="acronym">Regal</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2015-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/teams/regal</ref>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
            <relation active="#struct-86790" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-236317" status="VALID">
          <idno type="ROR">https://ror.org/05gq02987</idno>
          <orgName>Brown University</orgName>
          <desc>
            <address>
              <addrLine>Providence, Rhode Island 02912</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www.brown.edu/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-365620" status="VALID">
          <orgName>Microsoft Research</orgName>
          <desc>
            <address>
              <country key="US"/>
            </address>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</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"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-86790" status="OLD">
          <orgName>Inria Paris-Rocquencourt</orgName>
          <date type="end">2016-03-30</date>
          <desc>
            <address>
              <addrLine>INRIA Rocquencourt : Domaine de Voluceau, Rocquencourt B.P. 105 78153 le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris-rocquencourt</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <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"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>