Computer Arithmetic and Formal Proofs : Verifying Floating-point Algorithms with the Coq System - Boldo

Instant online reading.
Don't wait for delivery!
Go digital and save!

Computer Arithmetic and Formal Proofs

Verifying Floating-point Algorithms with the Coq System

By: Boldo, Melquiond

Write A Review

16 November 2017 | Edition Number 1

At a Glance

No. of Pages
326

Dimensions(cm)
22.86 x 15.24 x 2.54

RRP $299.95

$267.75

11%OFF

or 4 interest-free payments of $66.94 with

or

Ships in 5 to 7 business days

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

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.