A non-local method for robustness analysis of floating point programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

A non-local method for robustness analysis of floating point programs

Abstract

Robustness is a standard correctness property which intuitively means that if the input to the program changes less than a fixed small amount then the output changes only slightly. This notion is useful in the analysis of rounding error for floating point programs because it helps to establish bounds on output errors introduced by both measurement errors and by floating point computation. Compositional methods often do not work since key constructs---like the conditional and the while-loop---are not robust. We propose a method for proving the robustness of a while-loop. This method is non-local in the sense that instead of breaking the analysis down to single lines of code, it checks certain global properties of its structure. We show the applicability of our method on two standard algorithms: the CORDIC computation of the cosine and Dijkstra's shortest path algorithm.
Fichier principal
Vignette du fichier
proof_example.pdf (125.4 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00665995 , version 1 (03-02-2012)
hal-00665995 , version 2 (08-06-2012)
hal-00665995 , version 3 (09-07-2012)

Identifiers

Cite

Ivan Gazeau, Dale Miller, Catuscia Palamidessi. A non-local method for robustness analysis of floating point programs. QAPL - Tenth Workshop on Quantitative Aspects of Programming Languages, Mar 2012, Tallinn, Estonia. pp.63-76, ⟨10.4204/EPTCS.85.5⟩. ⟨hal-00665995v3⟩
333 View
306 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More