<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Computer arithmetic and formal proofs : verifying floating-point algorithms with the Coq system</title>
  </titleInfo>
  <name type="personal">
    <namePart>Boldo, Sylvie</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Melquiond, Guillaume</namePart>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">bibliography</genre>
  <genre authority="">Electronic books.</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">enk</placeTerm>
    </place>
    <dateIssued encoding="marc">2017</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="gmd">electronic resource</form>
    <extent>1 online resource</extent>
  </physicalDescription>
  <abstract>Floating-point arithmetic is ubiquitous in modern computing, as it is the tool of choice to approximate real numbers. Due to its limited range and precision, its use can become quite involved and potentially lead to numerous failures. One way to greatly increase confidence in floating-point software is by computer-assisted verification of its correctness proofs. This book provides a comprehensive view of how to formally specify and verify tricky floating-point algorithms with the Coq proof assistant. It describes the Flocq formalization of floating-point arithmetic and some methods to automate theorem proofs. It then presents the specification and verification of various algorithms, from error-free transformations to a numerical scheme for a partial differential equation. The examples cover not only mathematical algorithms but also C programs as well as issues related to compilation. Describes the notions of specification and weakest precondition computation and their practical useShows how to tackle algorithms that extend beyond the realm of simple floating-point arithmeticIncludes real analysis and a case study about numerical analysis.</abstract>
  <note type="statement of responsibility">Sylvie Boldo, Guillaume Melquiond.</note>
  <note>Includes bibliographical references and index.</note>
  <subject authority="lcsh">
    <titleInfo>
      <title>Coq (Electronic resource)</title>
    </titleInfo>
  </subject>
  <subject authority="lcsh">
    <topic>Computer arithmetic</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Floating-point arithmetic</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Computer algorithms</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>COMPUTERS</topic>
    <topic>Computer Literacy</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>COMPUTERS</topic>
    <topic>Computer Science</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>COMPUTERS</topic>
    <topic>Data Processing</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>COMPUTERS</topic>
    <topic>Hardware</topic>
    <topic>General</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>COMPUTERS</topic>
    <topic>Information Technology</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>COMPUTERS</topic>
    <topic>Machine Theory</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>COMPUTERS</topic>
    <topic>Reference</topic>
  </subject>
  <subject authority="bisacsh">
    <topic>MATHEMATICS</topic>
    <topic>Discrete Mathematics</topic>
  </subject>
  <subject authority="fast">
    <topic>Computer algorithms</topic>
  </subject>
  <subject authority="fast">
    <topic>Computer arithmetic</topic>
  </subject>
  <subject authority="fast">
    <topic>Floating-point arithmetic</topic>
  </subject>
  <classification authority="lcc">QA76.9.C62</classification>
  <classification authority="ddc" edition="23">004.01/51</classification>
  <relatedItem type="otherFormat" displayLabel="Print version:">
    <titleInfo>
      <title>Computer arithmetic and formal proofs : verifying floating-point algorithms with the Coq system</title>
    </titleInfo>
    <name>
      <namePart>Boldo, Sylvie.</namePart>
    </name>
    <originInfo>
      <publisher>London, England ; ISTE Press : Elsevier, �2017</publisher>
    </originInfo>
    <physicalDescription>
      <extent>xx, 306 pages</extent>
    </physicalDescription>
  </relatedItem>
  <identifier type="isbn">9780081011706</identifier>
  <identifier type="isbn">0081011709</identifier>
  <identifier type="isbn" invalid="yes"/>
  <identifier type="uri">https://www.sciencedirect.com/science/book/9781785481123</identifier>
  <identifier type="uri">http://www.sciencedirect.com/science/book/9781785481123</identifier>
  <location>
    <url displayLabel="ScienceDirect">https://www.sciencedirect.com/science/book/9781785481123</url>
  </location>
  <location>
    <url displayLabel="ScienceDirect">http://www.sciencedirect.com/science/book/9781785481123</url>
  </location>
  <recordInfo>
    <recordContentSource authority="marcorg">N$T</recordContentSource>
    <recordCreationDate encoding="marc">171120</recordCreationDate>
    <recordChangeDate encoding="iso8601">20190328114817.0</recordChangeDate>
    <recordIdentifier source="OCoLC">on1012400060</recordIdentifier>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
