Skip to main content

Computer Arithmetic and Formal Proofs

Verifying Floating-point Algorithms with the Coq System

  • 1st Edition - November 16, 2017
  • Latest edition
  • Authors: Sylvie Boldo, Guillaume Melquiond
  • Language: English

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 qu… Read more

World Book Day celebration

Where learning shapes lives

Up to 25% off trusted resources that support research, study, and discovery.

Description

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.

Key features

  • Describes the notions of specification and weakest precondition computation and their practical use
  • Shows how to tackle algorithms that extend beyond the realm of simple floating-point arithmetic
  • Includes real analysis and a case study about numerical analysis

Readership

Graduate students in computer science; Researchers in either computer arithmetic or formal verification

Table of contents

1. Floating-Point Arithmetic2. The Coq System3. Formalization of Formats and Basic Operators4. Automated Methods5. Error-Free Computations and Applications6. Example Proofs of Advanced Operators7. Compilation of FP Programs8. Deductive Program Verification9. Real and Numerical Analysis

Product details

  • Edition: 1
  • Latest edition
  • Published: November 16, 2017
  • Language: English

About the authors

SB

Sylvie Boldo

Sylvie Boldo is a Research Director at INRIA in Orsay, France.
Affiliations and expertise
INRIA, France

GM

Guillaume Melquiond

Guillaume Melquiond is a Researcher at INRIA in Orsay, France.
Affiliations and expertise
INRIA, France

View book on ScienceDirect

Read Computer Arithmetic and Formal Proofs on ScienceDirect