A library of Taylor models for PVS automatic proof checker
Francisco Cháves, Marc Daumas
Abstract
We present in this paper a library to compute with Taylor models, a technique extending interval arithmetic to reduce decorrelation and to solve differential equations. Numerical software usually produces only numerical results. Our library can be used to produce both results and proofs. As seen during the development of Fermat's last theorem reported by Aczel 1996, providing a proof is not sufficient. Our library provides a proof that has been thoroughly scrutinized by a trustworthy and tireless assistant. PVS is an automatic proof assistant that has been fairly developed and used and that has no internal connection with interval arithmetic or Taylor models. We built our library so that PVS validates each result as it is produced. As producing and validating a proof, is and will certainly remain a bigger task than just producing a numerical result our library will never be a replacement to imperative implementations of Taylor models such as Cosy Infinity. Our library should mainly be used to validate small to medium size results that are involved in safety or life critical applications.
Create a lesson
Related papers
The Art of Closed-Formula Defaults: Search-Free Code Generation for Tensor Operators
Paolo D'Alberto, Ashish Sirasao
Geometric Function Atlas: certified computing for geometric function theory in Python
Kishan Gurumurthy, Pushparaj Devadiga, Prasanna Devadiga et al.
Gradient Reconstruction in Lattice Boltzmann Methods for Systems of Conservation Laws
Adrian Kummerländer, Fedor Bukreev, Mathias J. Krause
BF16 Component-Product Emulation of FP32 and FP64 GEMM on Intel AMX
Bing Cui, Yu Liu
GRADSOLVE: fast exact gradients for ODE ensembles on GPUs
Alessio Spurio Mancini
Performance Evaluation of Fast Fourier Transforms on Emerging RISC-V Hardware with Vector Extension Support
Daniel Seibel, Kaveh Haghighi Mood, Jayesh Badwaik et al.