<?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-02526349</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-21T10:21:04+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A Mechanised Proof of an Adaptive State Counting Algorithm</title>
            <author role="aut">
              <persName>
                <forename type="first">Robert</forename>
                <surname>Sachtleben</surname>
              </persName>
              <email type="md5">3845130e497559a6d0d657097e395ba2</email>
              <email type="domain">uni-bremen.de</email>
              <idno type="idhal" notation="numeric">1067243</idno>
              <idno type="halauthorid" notation="string">1815502-1067243</idno>
              <affiliation ref="#struct-461380"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Robert</forename>
                <forename type="middle">M.</forename>
                <surname>Hierons</surname>
              </persName>
              <email type="md5">5159ad96ad8a9753208d89160d055d5a</email>
              <email type="domain">sheffield.ac.uk</email>
              <idno type="idhal" notation="numeric">1067244</idno>
              <idno type="halauthorid" notation="string">1165054-1067244</idno>
              <affiliation ref="#struct-153591"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Wen-Ling</forename>
                <surname>Huang</surname>
              </persName>
              <email type="md5">437bb8fd2a9252b28f2eee54e80db7f7</email>
              <email type="domain">uni-bremen.de</email>
              <idno type="idhal" notation="numeric">1067245</idno>
              <idno type="halauthorid" notation="string">1294423-1067245</idno>
              <affiliation ref="#struct-461380"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jan</forename>
                <surname>Peleska</surname>
              </persName>
              <email type="md5">d58aa28317ef12a485cd1fffc2efb574</email>
              <email type="domain">uni-bremen.de</email>
              <idno type="idhal" notation="numeric">1067246</idno>
              <idno type="halauthorid" notation="string">549474-1067246</idno>
              <affiliation ref="#struct-461380"/>
            </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">2020-03-31 15:13:54</date>
              <date type="whenModified">2024-11-22 17:02:02</date>
              <date type="whenReleased">2020-03-31 15:59:18</date>
              <date type="whenProduced">2019-10-15</date>
              <date type="whenEndEmbargoed">2022-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-02526349v1/document">
                <date notBefore="2022-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-02526349v1/file/482770_1_En_11_Chapter.pdf" id="file-2526349-2397695">
                <date notBefore="2022-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-02526349</idno>
            <idno type="halUri">https://inria.hal.science/hal-02526349</idno>
            <idno type="halBibtex">sachtleben:hal-02526349</idno>
            <idno type="halRefHtml">&lt;i&gt;31th IFIP International Conference on Testing Software and Systems (ICTSS)&lt;/i&gt;, Oct 2019, Paris, France. pp.176-193, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-31280-0_11"&gt;&amp;#x27E8;10.1007/978-3-030-31280-0_11&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">31th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2019, Paris, France. pp.176-193, &amp;#x27E8;10.1007/978-3-030-31280-0_11&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-2526349-2397695"/></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-ICTSS">IFIP-ICTSS</idno>
            <idno type="stamp" n="IFIP-LNCS-11812" corresp="IFIP-LNCS">Testing Software and Systems</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 4: Testing and Verification Techniques</note>
            <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">A Mechanised Proof of an Adaptive State Counting Algorithm</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Robert</forename>
                    <surname>Sachtleben</surname>
                  </persName>
                  <email type="md5">3845130e497559a6d0d657097e395ba2</email>
                  <email type="domain">uni-bremen.de</email>
                  <idno type="idhal" notation="numeric">1067243</idno>
                  <idno type="halauthorid" notation="string">1815502-1067243</idno>
                  <affiliation ref="#struct-461380"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Robert</forename>
                    <forename type="middle">M.</forename>
                    <surname>Hierons</surname>
                  </persName>
                  <email type="md5">5159ad96ad8a9753208d89160d055d5a</email>
                  <email type="domain">sheffield.ac.uk</email>
                  <idno type="idhal" notation="numeric">1067244</idno>
                  <idno type="halauthorid" notation="string">1165054-1067244</idno>
                  <affiliation ref="#struct-153591"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Wen-Ling</forename>
                    <surname>Huang</surname>
                  </persName>
                  <email type="md5">437bb8fd2a9252b28f2eee54e80db7f7</email>
                  <email type="domain">uni-bremen.de</email>
                  <idno type="idhal" notation="numeric">1067245</idno>
                  <idno type="halauthorid" notation="string">1294423-1067245</idno>
                  <affiliation ref="#struct-461380"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jan</forename>
                    <surname>Peleska</surname>
                  </persName>
                  <email type="md5">d58aa28317ef12a485cd1fffc2efb574</email>
                  <email type="domain">uni-bremen.de</email>
                  <idno type="idhal" notation="numeric">1067246</idno>
                  <idno type="halauthorid" notation="string">549474-1067246</idno>
                  <affiliation ref="#struct-461380"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>31th IFIP International Conference on Testing Software and Systems (ICTSS)</title>
                  <date type="start">2019-10-15</date>
                  <date type="end">2019-10-17</date>
                  <settlement>Paris</settlement>
                  <country key="FR">France</country>
                </meeting>
                <editor>Christophe Gaston</editor>
                <editor>Nikolai Kosmatov</editor>
                <editor>Pascale Le Gall</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Testing Software and Systems</biblScope>
                  <biblScope unit="volume">LNCS-11812</biblScope>
                  <biblScope unit="pp">176-193</biblScope>
                  <date type="datePub">2019</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-31280-0_11</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Mechanised proofs</term>
                <term xml:lang="en">Isabelle/HOL</term>
                <term xml:lang="en">Proof assistants</term>
                <term xml:lang="en">Reduction</term>
                <term xml:lang="en">Finite state machines</term>
                <term xml:lang="en">Complete test methods</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>In this paper it is demonstrated that the capabilities of state-of-the-art proof assistant tools are sufficient to present mechanised and, at the same time, human-readable proofs establishing completeness properties of test methods and the correctness of associated test generation algorithms. To this end, the well-known Isabelle/HOL proof assistant is used to mechanically verify a complete test theory elaborated by the second author for checking the reduction conformance relation between a possibly nondeterministic finite state machine (FSM) serving as reference model and an implementation whose behaviour can also be represented by an FSM. The formalisation also helps to clarify an ambiguity in the original test generation algorithm which was specified in natural language and could be misinterpreted in a way leading to insufficient fault coverage.</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-461380" status="VALID">
          <idno type="IdRef">026430967</idno>
          <idno type="ISNI">0000000122974381</idno>
          <idno type="ROR">https://ror.org/04ers2y35</idno>
          <idno type="Wikidata">Q500692</idno>
          <orgName>Universität Bremen [Deutschland] = University of Bremen [Germany] = Université de Brême [Allemagne]</orgName>
          <date type="start">1971-01-01</date>
          <desc>
            <address>
              <addrLine>P.O. Box 330440 28334 Bremen Germany</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">http://www.uni-bremen.de/en.html</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-153591" status="VALID">
          <idno type="ROR">https://ror.org/05krs5044</idno>
          <orgName>University of Sheffield [Sheffield]</orgName>
          <desc>
            <address>
              <addrLine>Western Bank Sheffield S10 2TN</addrLine>
              <country key="GB"/>
            </address>
            <ref type="url">http://www.sheffield.ac.uk/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>