<?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-01866271</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-19T17:26:31+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs</title>
            <author role="aut">
              <persName>
                <forename type="first">Yves</forename>
                <surname>Bertot</surname>
              </persName>
              <email type="md5">cf049ef367dd9aa5f7e3220f4bec3ad3</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">yves-bertot</idno>
              <idno type="idhal" notation="numeric">21022</idno>
              <idno type="halauthorid" notation="string">20411-21022</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-5052-3019</idno>
              <idno type="IDREF">https://www.idref.fr/060348313</idno>
              <affiliation ref="#struct-3208"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Yves</forename>
                <surname>Bertot</surname>
              </persName>
              <email type="md5">cf049ef367dd9aa5f7e3220f4bec3ad3</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-09-03 11:11:59</date>
              <date type="whenModified">2025-08-26 15:21:01</date>
              <date type="whenReleased">2018-09-03 13:32:39</date>
              <date type="whenProduced">2018-10-16</date>
              <date type="whenEndEmbargoed">2018-09-03</date>
              <ref type="file" target="https://inria.hal.science/hal-01866271v1/document">
                <date notBefore="2018-09-03"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01866271v1/file/main.pdf" id="file-1866271-1893575">
                <date notBefore="2018-09-03"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1809.00559"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="102675">
                <persName>
                  <forename>Yves</forename>
                  <surname>Bertot</surname>
                </persName>
                <email type="md5">cf049ef367dd9aa5f7e3220f4bec3ad3</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01866271</idno>
            <idno type="halUri">https://inria.hal.science/hal-01866271</idno>
            <idno type="halBibtex">bertot:hal-01866271</idno>
            <idno type="halRefHtml">&lt;i&gt;ICTAC 2018 - International Colloquium on Theoretical of Computing&lt;/i&gt;, Oct 2018, Stellenbosch, South Africa</idno>
            <idno type="halRef">ICTAC 2018 - International Colloquium on Theoretical of Computing, Oct 2018, Stellenbosch, South Africa</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1866271-1893575"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</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="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="1">Yes</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">Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Yves</forename>
                    <surname>Bertot</surname>
                  </persName>
                  <email type="md5">cf049ef367dd9aa5f7e3220f4bec3ad3</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">yves-bertot</idno>
                  <idno type="idhal" notation="numeric">21022</idno>
                  <idno type="halauthorid" notation="string">20411-21022</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-5052-3019</idno>
                  <idno type="IDREF">https://www.idref.fr/060348313</idno>
                  <affiliation ref="#struct-3208"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>ICTAC 2018 - International Colloquium on Theoretical of Computing</title>
                  <date type="start">2018-10-16</date>
                  <settlement>Stellenbosch</settlement>
                  <country key="ZA">South Africa</country>
                </meeting>
                <imprint/>
              </monogr>
              <idno type="arxiv">1809.00559</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halDomain" n="info.info-cg">Computer Science [cs]/Computational Geometry [cs.CG]</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>This extended abstract is about an effort to build a formal description of a triangulation algorithm starting with a naive description of the algorithm where triangles, edges, and triangulations are simply given as sets and the most complex notions are those of boundary and separating edges. When performing proofs about this algorithm, questions of symmetry appear and this exposition attempts to give an account of how these symmetries can be handled. All this work relies on formal developments made with Coq and the mathematical components library.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-3208" status="OLD">
          <idno type="RNSR">200618405J</idno>
          <orgName>Mathematical,  Reasoning and Software</orgName>
          <orgName type="acronym">MARELLE</orgName>
          <date type="start">2006-11-01</date>
          <date type="end">2019-10-31</date>
          <desc>
            <address>
              <addrLine>2004 route des lucioles06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www-sop.inria.fr/marelle/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-34586" status="VALID">
          <idno type="RNSR">198318250R</idno>
          <idno type="ROR">https://ror.org/01nzkaw91</idno>
          <orgName>Centre Inria d'Université Côte d'Azur</orgName>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/sophia/</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>