Add to ORKGInternational audienceIn this paper we present a general library to reason about floating-point numbers within the Coq system. Most of the results of the library are proved for an arbitrary floating-point format and an arbitrary base. A special emphasis has been put on proving properties for exact computing, i.e. computing without rounding errors
International audienceFloating-point arithmetic is known to be tricky: roundings, formats, exception...
Floating-point numbers have an intuitive meaning when it comes to physics-based numerical computatio...
International audienceFloating-point numbers are limited both in range and in precision, yet they ar...
International audienceIn this paper we present a general library to reason about floating-point numb...
Abstract. In this paper we present a general library to reason about floating-point numbers within t...
International audienceThe process of proving some mathematical theorems can be greatly reduced by re...
International audienceSeveral formalizations of floating-point arithmetic have been designed for the...
Some mathematical proofs involve intensive computations, for instance: the four-color theorem, Hales...
International audienceSome mathematical proofs involve intensive computations, for instance: the fou...
International audienceFloating-point arithmetic is a well-known and extremely efficient way of perfo...
AbstractThe process of proving some mathematical theorems can be greatly reduced by relying on numer...
International audienceHigh confidence in floating-point programs requires proving numerical properti...
International audienceFormal verification of numerical programs is notoriously difficult. On the one...
International audienceThe verification of floating-point mathematical libraries requires computing n...
International audienceFloating-point arithmetic is known to be tricky: roundings, formats, exception...
Floating-point numbers have an intuitive meaning when it comes to physics-based numerical computatio...
International audienceFloating-point numbers are limited both in range and in precision, yet they ar...
International audienceIn this paper we present a general library to reason about floating-point numb...
Abstract. In this paper we present a general library to reason about floating-point numbers within t...
International audienceThe process of proving some mathematical theorems can be greatly reduced by re...
International audienceSeveral formalizations of floating-point arithmetic have been designed for the...
Some mathematical proofs involve intensive computations, for instance: the four-color theorem, Hales...
International audienceSome mathematical proofs involve intensive computations, for instance: the fou...
International audienceFloating-point arithmetic is a well-known and extremely efficient way of perfo...
AbstractThe process of proving some mathematical theorems can be greatly reduced by relying on numer...
International audienceHigh confidence in floating-point programs requires proving numerical properti...
International audienceFormal verification of numerical programs is notoriously difficult. On the one...
International audienceThe verification of floating-point mathematical libraries requires computing n...
International audienceFloating-point arithmetic is known to be tricky: roundings, formats, exception...
Floating-point numbers have an intuitive meaning when it comes to physics-based numerical computatio...
International audienceFloating-point numbers are limited both in range and in precision, yet they ar...