<?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-02102507v2</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-17T02:11:26+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A certified infinite norm for the implementation of elementary functions</title>
            <author role="aut">
              <persName>
                <forename type="first">Sylvain</forename>
                <surname>Chevillard</surname>
              </persName>
              <email type="md5">1cf2c12f84494d7168db6517c3cc7302</email>
              <email type="domain">ens-lyon.org</email>
              <idno type="idhal" notation="string">sylvain-chevillard</idno>
              <idno type="idhal" notation="numeric">748596</idno>
              <idno type="halauthorid" notation="string">31646-748596</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2448-1625</idno>
              <affiliation ref="#struct-35418"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Christoph Quirin</forename>
                <surname>Lauter</surname>
              </persName>
              <idno type="halauthorid">142734-0</idno>
              <affiliation ref="#struct-35418"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Agnès</forename>
                <surname>Hermann</surname>
              </persName>
              <email type="md5">1a53cb266a2a1083edc93fd401af5d8d</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2019-04-17 13:54:46</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2024-10-09 13:03:02</date>
              <date type="whenModified">2025-10-13 09:44:14</date>
              <date type="whenReleased">2024-10-09 13:05:34</date>
              <date type="whenProduced">2007-10-11</date>
              <date type="whenEndEmbargoed">2024-10-09</date>
              <ref type="file" target="https://hal-lara.archives-ouvertes.fr/hal-02102507v2/document">
                <date notBefore="2024-10-09"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal-lara.archives-ouvertes.fr/hal-02102507v2/file/QSIC_fichierauteur.pdf" id="file-4727956-4114172">
                <date notBefore="2024-10-09"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="126341">
                <persName>
                  <forename>Agnès</forename>
                  <surname>Hermann</surname>
                </persName>
                <email type="md5">1a53cb266a2a1083edc93fd401af5d8d</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02102507</idno>
            <idno type="halUri">https://hal-lara.archives-ouvertes.fr/hal-02102507</idno>
            <idno type="halBibtex">chevillard:hal-02102507</idno>
            <idno type="halRefHtml">&lt;i&gt;QSIC 2007 - 7th International Conference on Quality Software&lt;/i&gt;, Oct 2007, Portland, United States. pp.1-9, &lt;a target="_blank" href="https://dx.doi.org/10.1109/QSIC.2007.4385491"&gt;&amp;#x27E8;10.1109/QSIC.2007.4385491&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">QSIC 2007 - 7th International Conference on Quality Software, Oct 2007, Portland, United States. pp.1-9, &amp;#x27E8;10.1109/QSIC.2007.4385491&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-4727956-4114172"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-LYON1">Université Claude Bernard - Lyon I</idno>
            <idno type="stamp" n="LIP" corresp="UNIV-LYON1">Laboratoire de l'Informatique du Parallélisme</idno>
            <idno type="stamp" n="LARA">LARA</idno>
            <idno type="stamp" n="UDL">UDL</idno>
            <idno type="stamp" n="UNIV-LYON">Université de Lyon</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">A certified infinite norm for the implementation of elementary functions</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Sylvain</forename>
                    <surname>Chevillard</surname>
                  </persName>
                  <email type="md5">1cf2c12f84494d7168db6517c3cc7302</email>
                  <email type="domain">ens-lyon.org</email>
                  <idno type="idhal" notation="string">sylvain-chevillard</idno>
                  <idno type="idhal" notation="numeric">748596</idno>
                  <idno type="halauthorid" notation="string">31646-748596</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2448-1625</idno>
                  <affiliation ref="#struct-35418"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Christoph Quirin</forename>
                    <surname>Lauter</surname>
                  </persName>
                  <idno type="halauthorid">142734-0</idno>
                  <affiliation ref="#struct-35418"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>QSIC 2007 - 7th International Conference on Quality Software</title>
                  <date type="start">2007-10-11</date>
                  <date type="end">2007-10-12</date>
                  <settlement>Portland</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">1-9</biblScope>
                  <date type="datePub">2007-06</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1109/QSIC.2007.4385491</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Certified infinite norm</term>
                <term xml:lang="en">Interval arithmetic</term>
                <term xml:lang="en">Elementary functions</term>
                <term xml:lang="fr">Fonctions élémentaires</term>
                <term xml:lang="fr">Norme infinie certifiée</term>
                <term xml:lang="fr">Arithmétique d'intervalles</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>The high-quality floating-point implementation of useful functions f : R → R,such as exp, sin, erf requires bounding the error ε = p−f f of an approximation p with regard to the function f. This involves bounding the infinite norm kεk∞ of the error function. Its value must not be underestimated when implementations must be safe.Previous approaches for computing infinite norm are shown to be either unsafe,not sufficiently tight or too tedious in manual work.We present a safe and self-validating algorithm for automatically upper- andlower-bounding infinite norms of error functions. The algorithm is based onenhanced interval arithmetic. It can overcome high cancellation and high conditionnumber around points where the error function is defined only by continuousextension.The given algorithm is implemented in a software tool. It can generate a proofof correctness for each instance on which it is run.</p>
            </abstract>
            <abstract xml:lang="fr">
              <p>Pour garantir la qualité de l’implémentation en arithmétique flottante de fonctionsusuelles f : R → R telles que exp, sin, erf, il faut borner l’erreur ε = p−ffcommise entre f et une approximation p. Cela implique de borner la normeinfinie kεk∞de la fonction d’erreur. Si on veut que l’implémentation soit sure,on ne doit en aucun cas renvoyer une borne inférieure à la valeur exacte.Nous montrons que les approches précéedentes visant à calculer la norme infiniene sont pas satisfaisantes : soit elles ne sont pas sures, soit pas assez précises,soit elles nécessitent un travail manuel trop fastidieux.Nous présentons un algorithme sûr, qui fournit une preuve de sa propre correction,et qui minore et majore automatiquement la norme infinie de fonctionsd’erreur. Cet algorithme est fondé sur une version améliorée d’arithmétiqued’intervalle. Il peut contourner les difficultées dues à une grande cancellationet un mauvais conditionnement autour de points où la fonction d’erreur n’estdéfinie que par continuité.L’algorithme proposé a été implémenté dans un outil logiciel. Il peut générerune preuve de correction pour toute instance sur laquelle il est exécuté.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-35418" status="VALID">
          <idno type="IdRef">191041289</idno>
          <idno type="ISNI">0000000104538607</idno>
          <idno type="RNSR">200317503S</idno>
          <idno type="ROR">04msnz457</idno>
          <orgName>Laboratoire de l'Informatique du Parallélisme</orgName>
          <orgName type="acronym">LIP</orgName>
          <date type="start">1990-01-01</date>
          <desc>
            <address>
              <addrLine>46 Allée d'Italie 69364 LYON CEDEX 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-lyon.fr/LIP/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6818" type="direct"/>
            <relation active="#struct-301088" type="direct"/>
            <relation active="#struct-194495" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="UMR5668 / URA1398" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-6818" status="VALID">
          <idno type="IdRef">149154992</idno>
          <idno type="ISNI">0000000123319856</idno>
          <idno type="ROR">https://ror.org/04zmssz18</idno>
          <idno type="Wikidata">Q10159</idno>
          <orgName>École normale supérieure de Lyon</orgName>
          <orgName type="acronym">ENS de Lyon</orgName>
          <date type="start">2010-01-01</date>
          <desc>
            <address>
              <addrLine>15 parvis René Descartes - BP 7000 - 69342 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ens-lyon.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301088" status="VALID">
          <idno type="ROR">https://ror.org/01rk35k63</idno>
          <orgName>Université de Lyon</orgName>
          <desc>
            <address>
              <addrLine>92 rue Pasteur - CS 30122, 69361 Lyon Cedex 07</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-lyon.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-194495" status="VALID">
          <idno type="IdRef">026402823</idno>
          <idno type="ISNI">0000000121686185</idno>
          <idno type="ROR">https://ror.org/029brtt94</idno>
          <orgName>Université Claude Bernard Lyon 1</orgName>
          <orgName type="acronym">UCBL</orgName>
          <desc>
            <address>
              <addrLine>43, boulevard du 11 novembre 1918, 69622 Villeurbanne cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lyon1.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301088" 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="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>
      </listOrg>
    </back>
  </text>
</TEI>