Optimal approximation for efficient termination analysis of Floating-point Loops - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

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.
Fichier principal
Vignette du fichier
17-MauricaMP-NextComp.pdf (324.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01579791 , version 1 (31-08-2017)

Identifiers

Cite

Fonenantsoa Maurica Andrianampoizinimaro, Frédéric Mesnard, Etienne Payet. Optimal approximation for efficient termination analysis of Floating-point Loops. 1st International Conference on Next Generation Computing Applications (NextComp2017), Jul 2017, Pointe aux Piments, Mauritius. pp.17-22, ⟨10.1109/NEXTCOMP.2017.8016170⟩. ⟨hal-01579791⟩
115 View
114 Download

Altmetric

Share

Gmail Facebook X LinkedIn More