<?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-01824815</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-21T00:05:59+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency</title>
            <author role="aut">
              <persName>
                <forename type="first">Kim</forename>
                <surname>Völlinger</surname>
              </persName>
              <email type="md5">c6e421e93c8cdefea21bc7e039c0db71</email>
              <email type="domain">hu-berlin.de</email>
              <idno type="idhal" notation="numeric">1033826</idno>
              <idno type="halauthorid" notation="string">1388077-1033826</idno>
              <affiliation ref="#struct-457432"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Samira</forename>
                <surname>Akili</surname>
              </persName>
              <idno type="halauthorid">1388078-0</idno>
              <affiliation ref="#struct-457432"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-06-27 15:55:26</date>
              <date type="whenModified">2018-07-26 14:58:07</date>
              <date type="whenReleased">2018-06-27 15:58:55</date>
              <date type="whenProduced">2018-06-18</date>
              <date type="whenEndEmbargoed">2021-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01824815v1/document">
                <date notBefore="2021-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01824815v1/file/469043_1_En_9_Chapter.pdf" id="file-1824815-1852307">
                <date notBefore="2021-01-01"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01824815</idno>
            <idno type="halUri">https://inria.hal.science/hal-01824815</idno>
            <idno type="halBibtex">vollinger:hal-01824815</idno>
            <idno type="halRefHtml">&lt;i&gt;38th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)&lt;/i&gt;, Jun 2018, Madrid, Spain. pp.161-180, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-92612-4_9"&gt;&amp;#x27E8;10.1007/978-3-319-92612-4_9&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">38th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2018, Madrid, Spain. pp.161-180, &amp;#x27E8;10.1007/978-3-319-92612-4_9&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1824815-1852307"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-WG" corresp="IFIP">Working Groups</idno>
            <idno type="stamp" n="IFIP-TC6" corresp="IFIP-TC">TC 6: Communication Systems</idno>
            <idno type="stamp" n="IFIP-WG6-1" corresp="IFIP-WG">Architectures and Protocols for Distributed Systems</idno>
            <idno type="stamp" n="IFIP-FORTE">IFIP-FORTE</idno>
            <idno type="stamp" n="IFIP-DISCOTEC">International Federated Conference on Distributed Computing Techniques</idno>
            <idno type="stamp" n="IFIP-LNCS-10854" corresp="IFIP-LNCS">Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2018)</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">On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Kim</forename>
                    <surname>Völlinger</surname>
                  </persName>
                  <email type="md5">c6e421e93c8cdefea21bc7e039c0db71</email>
                  <email type="domain">hu-berlin.de</email>
                  <idno type="idhal" notation="numeric">1033826</idno>
                  <idno type="halauthorid" notation="string">1388077-1033826</idno>
                  <affiliation ref="#struct-457432"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Samira</forename>
                    <surname>Akili</surname>
                  </persName>
                  <idno type="halauthorid">1388078-0</idno>
                  <affiliation ref="#struct-457432"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>38th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)</title>
                  <date type="start">2018-06-18</date>
                  <date type="end">2018-06-21</date>
                  <settlement>Madrid</settlement>
                  <country key="ES">Spain</country>
                </meeting>
                <editor>Christel Baier</editor>
                <editor>Luís Caires</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Formal Techniques for Distributed Objects, Components, and Systems</biblScope>
                  <biblScope unit="volume">LNCS-10854</biblScope>
                  <biblScope unit="pp">161-180</biblScope>
                  <date type="datePub">2018</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-92612-4_9</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Formal instance verification</term>
                <term xml:lang="en">Distributed algorithm</term>
                <term xml:lang="en">Certification</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</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>A major problem in software engineering is assuring the correctness of a distributed system. A certifying distributed algorithm (CDA) computes for its input-output pair (i, o) an additional witness w – a formal argument for the correctness of (i, o). Each CDA features a witness predicate such that if the witness predicate holds for a triple (i, o, w), the input-output pair (i, o) is correct. An accompanying checker algorithm decides the witness predicate. Consequently, a user of a CDA does not have to trust the CDA but its checker algorithm. Usually, a checker is simpler and its verification is feasible. To sum up, the idea of a CDA is to adapt the underlying algorithm of a program at design-time such that it verifies its own output at runtime. While certifying sequential algorithms are well-established, there are open questions on how to apply certification to distributed algorithms. In this paper, we discuss distributed checking of a distributed witness; one challenge is that all parts of a distributed witness have to be consistent with each other. Furthermore, we present a method for formal instance verification (i.e. obtaining a machine-checked proof that a particular input-output pair is correct), and implement the method in a framework for the theorem prover Coq.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 6</org>
              <org type="consortium">WG 6.1</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-457432" status="VALID">
          <idno type="ROR">https://ror.org/02qt0xs84</idno>
          <orgName>Humboldt State University</orgName>
          <orgName type="acronym">HSU</orgName>
          <desc>
            <address>
              <addrLine>1 Harpst St, Arcata, CA 95521</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://humboldt.edu/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>