Optimal approximation for efficient termination analysis of Floating-point Loops

Abstract

Floating-point numbers are used in a wide variety of programs, from numerical analysis programs to control command programs. However floating-point computations are affected by rounding errors that render them hard to be verified efficiently. We address in this paper termination proving of an important class of programs that manipulate floating-point numbers: the simple floating-point loops. Our main contribution is an optimal approximation to the rationals that allows us to efficiently analyze their termination.

4 Figures and Tables

Cite this paper

@article{Maurica2017OptimalAF, title={Optimal approximation for efficient termination analysis of Floating-point Loops}, author={Fonenantsoa Maurica and F. Mesnard and x00C9tienne Payet}, journal={2017 1st International Conference on Next Generation Computing Applications (NextComp)}, year={2017}, pages={17-22} }