Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1145/1141277.1141586 | SAC |
Keywords | Field | DocType |
rounding mode,floating-point number,floating-point arithmetic,sufficient condition,floating-point computation,well-known formalization,program verification system,proof assistant coq,polynomial evaluation,powerful proof automation,provably faithful evaluation,formal verification,floating point | Polynomial,Floating point,Computer science,Theoretical computer science,Automation,Rounding,Verification system,Formal verification,Proof assistant,Computation | Conference |
ISBN | Citations | PageRank |
1-59593-108-2 | 4 | 0.59 |
References | Authors | |
13 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sylvie Boldo | 1 | 292 | 26.85 |
| César Muñoz | 2 | 76 | 6.39 |