Provably Faithful Evaluation of PolynomialsReport as inadecuate




Provably Faithful Evaluation of Polynomials - Download this document for free, or read online. Document in PDF available to download.

1 PROVAL - Proof of Programs UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR 2 NIA - National Institute of Aerospace Hampton

Abstract : We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of floating-point numbers and rounding modes in the Program Verification System PVS. Our work is based on a well-known formalization of floating-point arithmetic in the proof assistant Coq, where polynomial evaluation has been already studied. However, thanks to the powerful proof automation provided by PVS, the sufficient conditions proposed in our work are more general than the original ones.





Author: Sylvie Boldo - César Muñoz -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents