Computer arithmetic and formal proofs : verifying floating-point algorithms with the Coq system / Sylvie Boldo, Guillaume Melquiond.

By: Boldo, Sylvie [author.]Contributor(s): Melquiond, Guillaume [author.]Material type: TextTextPublisher: London : Oxford, UK : ISTE Press ; Elsevier, 2017Description: 1 online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9780081011706; 0081011709; 1785481126; 9781785481123Subject(s): Coq (Electronic resource) | Computer arithmetic | Floating-point arithmetic | Computer algorithmsAdditional physical formats: Print version:: Computer arithmetic and formal proofs : verifying floating-point algorithms with the Coq system.DDC classification: 004.01/51 LOC classification: QA76.9.C62Online resources: ScienceDirect Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode Item holds
Available
Total holds: 0

Includes bibliographical references and index.

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.

Vendor-supplied metadata.

There are no comments on this title.

to post a comment.
SIKKIM UNIVERSITY
University Portal | Contact Librarian | Library Portal

Powered by Koha