Computer Science – Programming Languages
Scientific paper
2012-02-03
QAPL - Tenth Workshop on Quantitative Aspects of Programming Languages (2012)
Computer Science
Programming Languages
Scientific paper
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.
Gazeau Ivan
Miller Daniel D.
Palamidessi Catuscia
No associations
LandOfFree
A non-local method for robustness analysis of floating point programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A non-local method for robustness analysis of floating point programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A non-local method for robustness analysis of floating point programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-4663