Provably Faithful Evaluation of Polynomials

Sylvie Boldo 1 César Muñoz 2
1 PROVAL - Proof of Programs
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR
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.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/inria-00000892
Contributor : Sylvie Boldo <>
Submitted on : Thursday, December 1, 2005 - 3:22:13 PM
Last modification on : Monday, October 14, 2019 - 9:19:49 AM
Long-term archiving on : Friday, April 2, 2010 - 11:18:20 PM

Files

Identifiers

  • HAL Id : inria-00000892, version 1

Collections

Citation

Sylvie Boldo, César Muñoz. Provably Faithful Evaluation of Polynomials. 21st Annual ACM Symposium on Applied Computing, Apr 2006, Dijon, France. ⟨inria-00000892⟩

Share

Metrics

Record views

522

Files downloads

298