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 audienceFloating-point numbers are limited both in range and in precision, yet they ar...
International audienceFloating-point arithmetic is known to be tricky: roundings, formats, exception...
Some mathematical proofs involve intensive computations, for instance: the four-color theorem, Hales...
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 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...
Several formalizations of floating-point arithmetic have been designed for the Coq system, a generic...
International audienceSome mathematical proofs involve intensive computations, for instance: the fou...
International audienceFormal verification of numerical programs is notoriously difficult. On the one...
Abstract. In this paper we present a general library to reason about floating-point numbers within t...
International audienceFloating-point numbers are limited both in range and in precision, yet they ar...
International audienceFloating-point arithmetic is known to be tricky: roundings, formats, exception...
Some mathematical proofs involve intensive computations, for instance: the four-color theorem, Hales...
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 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...
Several formalizations of floating-point arithmetic have been designed for the Coq system, a generic...
International audienceSome mathematical proofs involve intensive computations, for instance: the fou...
International audienceFormal verification of numerical programs is notoriously difficult. On the one...
Abstract. In this paper we present a general library to reason about floating-point numbers within t...
International audienceFloating-point numbers are limited both in range and in precision, yet they ar...
International audienceFloating-point arithmetic is known to be tricky: roundings, formats, exception...
Some mathematical proofs involve intensive computations, for instance: the four-color theorem, Hales...