@inproceedings{mos-mun-smi-15-aa-proving,
  author = {Moscato, Mariano M. and Mu{\~{n}}oz, C{\'e}sar A. and Smith, Andrew P.},
  title = {Affine Arithmetic and Applications to Real-Number Proving},
  booktitle = {Interactive Theorem Proving},
  series = {LNCS},
  volume = {9236},
  year = 2015,
  publisher = {Springer},
  pages = {294--309},
  doi = {10.1007/978-3-319-22102-1_20},
  comment = {General uses},
  abstract = {Accuracy and correctness are central issues in numerical analysis. To address these issues, several self-validated computation methods have been proposed in the last fifty years. Their common goal is to provide rigorously correct enclosures for calculated values, sacrificing a measure of precision for correctness. Perhaps the most widely adopted enclosure method is interval arithmetic. Interval arithmetic performs well in a wide range of cases, but often produces excessively large overestimations, unless the domain is reduced in size, e.g., by subdivision. Many extensions of interval arithmetic have been developed in order to cope with this problem. Among them, affine arithmetic provides tighter estimations by taking into account linear correlations between operands. This paper presents a formalization of affine arithmetic, written in the Prototype Verification System (PVS), along with a formally verified branch-and-bound procedure implementing that model. This procedure and its correctness property enables the implementation of a PVS strategy for automatically computing upper and lower bounds of real-valued expressions that are provably correct up to a user-specified precision.}
}