Computer Arithmetic and Formal Proofs

Verifying Floating-point Algorithms with the Coq System

By: Sylvie Boldo, Guillaume Melquiond

Write A Review

eText | 17 November 2017

At a Glance

Format
ePUB

eText

$206.95

or 4 interest-free payments of $51.74 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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 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