International audienceThe 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
International audienceThe verification of floating-point mathematical libraries requires computing n...
The verification of floating-point mathematical libraries requires computing numerical bounds on app...
International audienceFloating-point numbers are limited both in range and in precision, yet they ar...
International audienceThe process of proving some mathematical theorems can be greatly reduced by re...
AbstractThe process of proving some mathematical theorems can be greatly reduced by relying on numer...
International audienceSeveral formalizations of floating-point arithmetic have been designed for the...
International audienceSome mathematical proofs involve intensive computations, for instance: the fou...
Some mathematical proofs involve intensive computations, for instance: the four-color theorem, Hales...
International audienceFloating-point arithmetic is a well-known and extremely efficient way of perfo...
International audienceFloating-point arithmetic is ubiquitous in modern computing, as it is the tool...
International audienceFormal verification of numerical programs is notoriously difficult. On the one...
International audienceIn this paper we present a general library to reason about floating-point numb...
International audienceThe verification of floating-point mathematical libraries requires computing n...
The verification of floating-point mathematical libraries requires computing numerical bounds on app...
International audienceFloating-point numbers are limited both in range and in precision, yet they ar...
International audienceThe process of proving some mathematical theorems can be greatly reduced by re...
AbstractThe process of proving some mathematical theorems can be greatly reduced by relying on numer...
International audienceSeveral formalizations of floating-point arithmetic have been designed for the...
International audienceSome mathematical proofs involve intensive computations, for instance: the fou...
Some mathematical proofs involve intensive computations, for instance: the four-color theorem, Hales...
International audienceFloating-point arithmetic is a well-known and extremely efficient way of perfo...
International audienceFloating-point arithmetic is ubiquitous in modern computing, as it is the tool...
International audienceFormal verification of numerical programs is notoriously difficult. On the one...
International audienceIn this paper we present a general library to reason about floating-point numb...
International audienceThe verification of floating-point mathematical libraries requires computing n...
The verification of floating-point mathematical libraries requires computing numerical bounds on app...
International audienceFloating-point numbers are limited both in range and in precision, yet they ar...