Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Formally Verified Approximations of Definite Integrals

Abstract : Finding an elementary form for an antiderivative is often a difficult task, so numerical integration has become a common tool when it comes to making sense of a definite integral. Some of the numerical integration methods can even be made rigorous: not only do they compute an approximation of the integral value but they also bound its inaccuracy. Yet numerical integration is still missing from the toolbox when performing formal proofs in analysis. This paper presents an efficient method for automatically computing and proving bounds on some definite integrals inside the Coq formal system. Our approach is not based on traditional quadrature methods such as Newton-Cotes formulas. Instead, it relies on computing and evaluating antiderivatives of rigorous polynomial approximations, combined with an adaptive domain splitting. This work has been integrated to the CoqInterval library.
Complete list of metadatas
Contributor : Guillaume Melquiond <>
Submitted on : Thursday, March 17, 2016 - 9:39:24 AM
Last modification on : Monday, December 9, 2019 - 5:24:07 PM
Document(s) archivé(s) le : Saturday, June 18, 2016 - 5:54:41 PM


Files produced by the author(s)


  • HAL Id : hal-01289616, version 1


Assia Mahboubi, Guillaume Melquiond, Thomas Sibut-Pinote. Formally Verified Approximations of Definite Integrals. 2016. ⟨hal-01289616v1⟩



Record views


Files downloads