<?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-04165169</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-18T18:47:01+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Slimmer Formal Proofs for Mathematical Libraries</title>
            <author role="aut">
              <persName>
                <forename type="first">Paul</forename>
                <surname>Geneau de Lamarlière</surname>
              </persName>
              <email type="md5">46c6a2cd6b2e5e31ab6c3678ae1938da</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">paul-geneau-de-lamarliere</idno>
              <idno type="idhal" notation="numeric">1379587</idno>
              <idno type="halauthorid" notation="string">2863262-1379587</idno>
              <idno type="ORCID">https://orcid.org/0009-0006-6688-8796</idno>
              <affiliation ref="#struct-1066537"/>
              <affiliation ref="#struct-204860"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Guillaume</forename>
                <surname>Melquiond</surname>
              </persName>
              <email type="md5">1154441c6f9d388508086ec1ea8c18fa</email>
              <email type="domain">inria.fr</email>
              <ptr type="url" target="https://guillaume.melquiond.fr/"/>
              <idno type="idhal" notation="string">guillaume-melquiond</idno>
              <idno type="idhal" notation="numeric">1146</idno>
              <idno type="halauthorid" notation="string">15444-1146</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6697-1809</idno>
              <idno type="IDREF">https://www.idref.fr/117280836</idno>
              <idno type="ARXIV">https://arxiv.org/a/melquiond_g_1</idno>
              <idno type="GOOGLE SCHOLAR">SuXuWQwAAAAJ</idno>
              <affiliation ref="#struct-1066537"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Florian</forename>
                <surname>Faissole</surname>
              </persName>
              <email type="md5">1beefd5e5751c267ebf92aafda366793</email>
              <email type="domain">fr.merce.mee.com</email>
              <idno type="idhal" notation="numeric">1095588</idno>
              <idno type="halauthorid" notation="string">1076570-1095588</idno>
              <affiliation ref="#struct-204860"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Guillaume</forename>
                <surname>Melquiond</surname>
              </persName>
              <email type="md5">1154441c6f9d388508086ec1ea8c18fa</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder ref="#projanr-51743"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2023-07-18 16:48:09</date>
              <date type="whenWritten">2023-04</date>
              <date type="whenModified">2025-10-24 16:40:02</date>
              <date type="whenReleased">2023-07-19 04:17:18</date>
              <date type="whenProduced">2023-09-04</date>
              <date type="whenEndEmbargoed">2023-07-18</date>
              <ref type="file" target="https://inria.hal.science/hal-04165169v1/document">
                <date notBefore="2023-07-18"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-04165169v1/file/article.pdf" id="file-4165169-3627050">
                <date notBefore="2023-07-18"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="117957">
                <persName>
                  <forename>Guillaume</forename>
                  <surname>Melquiond</surname>
                </persName>
                <email type="md5">1154441c6f9d388508086ec1ea8c18fa</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04165169</idno>
            <idno type="halUri">https://inria.hal.science/hal-04165169</idno>
            <idno type="halBibtex">geneaudelamarliere:hal-04165169</idno>
            <idno type="halRefHtml">&lt;i&gt;30th IEEE International Symposium on Computer Arithmetic&lt;/i&gt;, Sep 2023, Portland (Oregon), United States. pp.4, &lt;a target="_blank" href="https://dx.doi.org/10.1109/ARITH58626.2023.00026"&gt;&amp;#x27E8;10.1109/ARITH58626.2023.00026&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">30th IEEE International Symposium on Computer Arithmetic, Sep 2023, Portland (Oregon), United States. pp.4, &amp;#x27E8;10.1109/ARITH58626.2023.00026&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-4165169-3627050"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <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="ENS-CACHAN">Ecole Normale Supérieure de Cachan</idno>
            <idno type="stamp" n="INRIA-SACLAY" corresp="INRIA">INRIA Saclay - Ile de France</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="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="ENS-PARIS-SACLAY">Ecole Normale Supérieure paris-Saclay</idno>
            <idno type="stamp" n="ENS-PSACLAY">Ecole Normale Supérieure Paris-Saclay</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="LMF">Laboratoire Méthodes Formelles</idno>
            <idno type="stamp" n="LMF-AR">Arithmétique</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">Slimmer Formal Proofs for Mathematical Libraries</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Paul</forename>
                    <surname>Geneau de Lamarlière</surname>
                  </persName>
                  <email type="md5">46c6a2cd6b2e5e31ab6c3678ae1938da</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">paul-geneau-de-lamarliere</idno>
                  <idno type="idhal" notation="numeric">1379587</idno>
                  <idno type="halauthorid" notation="string">2863262-1379587</idno>
                  <idno type="ORCID">https://orcid.org/0009-0006-6688-8796</idno>
                  <affiliation ref="#struct-1066537"/>
                  <affiliation ref="#struct-204860"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Guillaume</forename>
                    <surname>Melquiond</surname>
                  </persName>
                  <email type="md5">1154441c6f9d388508086ec1ea8c18fa</email>
                  <email type="domain">inria.fr</email>
                  <ptr type="url" target="https://guillaume.melquiond.fr/"/>
                  <idno type="idhal" notation="string">guillaume-melquiond</idno>
                  <idno type="idhal" notation="numeric">1146</idno>
                  <idno type="halauthorid" notation="string">15444-1146</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6697-1809</idno>
                  <idno type="IDREF">https://www.idref.fr/117280836</idno>
                  <idno type="ARXIV">https://arxiv.org/a/melquiond_g_1</idno>
                  <idno type="GOOGLE SCHOLAR">SuXuWQwAAAAJ</idno>
                  <affiliation ref="#struct-1066537"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Florian</forename>
                    <surname>Faissole</surname>
                  </persName>
                  <email type="md5">1beefd5e5751c267ebf92aafda366793</email>
                  <email type="domain">fr.merce.mee.com</email>
                  <idno type="idhal" notation="numeric">1095588</idno>
                  <idno type="halauthorid" notation="string">1076570-1095588</idno>
                  <affiliation ref="#struct-204860"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>30th IEEE International Symposium on Computer Arithmetic</title>
                  <date type="start">2023-09-04</date>
                  <date type="end">2023-09-06</date>
                  <settlement>Portland (Oregon)</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <biblScope unit="serie">2023 IEEE 30th Symposium on Computer Arithmetic (ARITH 2023)</biblScope>
                  <biblScope unit="pp">4</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.1109/ARITH58626.2023.00026</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Formal methods</term>
                <term xml:lang="en">Coq proof assistant</term>
                <term xml:lang="en">Mathematical libraries</term>
                <term xml:lang="en">Floating-point arithmetic</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>Short of being able to exhaustively test all the inputs, writing a formal proof offers the highest possible confidence in the correctness of a mathematical library. This comes at a large cost though, since formal proofs require taking into account all the details, even the seemingly insignificant ones, which makes them tedious to write. This issue is compounded by the fact that the objects whose properties we need to verify (floating-point numbers) are not the ones we would like to reason about (real numbers and integers). This short paper explores some ways of reducing the overhead of formal proofs in the setting of mathematical libraries, so as to let the user focus on the details that really matter.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-1066537" status="VALID">
          <idno type="RNSR">201221053L</idno>
          <idno type="ROR">https://ror.org/028m5h544</idno>
          <orgName>Formally Verified Programs, Certified Tools and Numerical Computations</orgName>
          <orgName type="acronym">TOCCATA</orgName>
          <date type="start">2021-01-01</date>
          <date type="end">2026-06-30</date>
          <desc>
            <address>
              <addrLine>Université Paris-Saclay; Bâtiment 650 ; 91405 ORSAY CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://toccata.gitlabpages.inria.fr/toccata/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-1065710" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-419361" type="indirect"/>
            <relation name="UMR9021" active="#struct-441569" type="indirect"/>
            <relation active="#struct-523723" type="indirect"/>
            <relation active="#struct-1225627" type="direct"/>
            <relation active="#struct-118511" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-204860" status="VALID">
          <orgName>Mitsubishi Electric R&amp;D Centre Europe [France]</orgName>
          <orgName type="acronym">MERCE-France</orgName>
          <desc>
            <address>
              <addrLine>1, allée de Beaulieu CS 10806 35708 RENNES CEDEX 7</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-372168" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-1065710" status="VALID">
          <idno type="IdRef">25474589X</idno>
          <idno type="RNSR">202123712M</idno>
          <idno type="ROR">https://ror.org/00gdtta79</idno>
          <idno type="Wikidata">Q109042513</idno>
          <orgName>Laboratoire Méthodes Formelles</orgName>
          <orgName type="acronym">LMF</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>4, avenue des Sciences, 91190, Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-419361" type="direct"/>
            <relation name="UMR9021" active="#struct-441569" type="direct"/>
            <relation active="#struct-523723" 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>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-419361" status="VALID">
          <idno type="IdRef">241345251</idno>
          <idno type="ROR">https://ror.org/03xjwb503</idno>
          <orgName>Université Paris-Saclay</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment Bréguet, 3 Rue Joliot Curie 2e ét, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-paris-saclay.fr/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="institution" xml:id="struct-523723" status="VALID">
          <idno type="ROR">https://ror.org/00hx6zz33</idno>
          <orgName>Ecole Normale Supérieure  Paris-Saclay</orgName>
          <orgName type="acronym">ENS Paris Saclay</orgName>
          <desc>
            <address>
              <addrLine>4 avenue des Sciences, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://ens-paris-saclay.fr/</ref>
          </desc>
        </org>
        <org type="department" xml:id="struct-1225627" status="VALID">
          <idno type="ROR">https://ror.org/040753f36</idno>
          <orgName>Centre Inria de l'Université Paris-Saclay</orgName>
          <date type="start">2022-11-01</date>
          <desc>
            <address>
              <addrLine>9 Rue Joliot Curie, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-118511" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-118511" status="VALID">
          <idno type="RNSR">200818248E</idno>
          <idno type="ROR">https://ror.org/0315e5x55</idno>
          <orgName>Centre Inria de Saclay</orgName>
          <desc>
            <address>
              <addrLine>1 rue Honoré d'Estienne d'OrvesBâtiment Alan TuringCampus de l'École Polytechnique91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/saclay</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-372168" status="VALID">
          <orgName>Mitsubishi Electric [France]</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://fr.mitsubishielectric.com/fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-51743" status="VALID">
          <idno type="anr">ANR-20-CE48-0014</idno>
          <orgName>NuSCAP</orgName>
          <desc>Sûreté numérique pour les preuves assistées par ordinateur</desc>
          <date type="start">2020</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>