Article ID Journal Published Year Pages File Type
426557 Information and Computation 2012 10 Pages PDF
Abstract

The process of proving some mathematical theorems can be greatly reduced by relying on numerically-intensive computations with a certified arithmetic. This article presents a formalization of floating-point arithmetic that makes it possible to efficiently compute inside the proofs of the Coq system. This certified library is a multi-radix and multi-precision implementation free from underflow and overflow. It provides the basic arithmetic operators and a few elementary functions.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
,