pith. sign in

arxiv: 1808.04289 · v2 · pith:DNLEEI3Wnew · submitted 2018-08-13 · 💻 cs.PL · cs.LO

Eliminating Unstable Tests in Floating-Point Programs

classification 💻 cs.PL cs.LO
keywords floating-pointprogramcomputationrealtransformationdifferenceflowflows
0
0 comments X
read the original abstract

Round-off errors arising from the difference between real numbers and their floating-point representation cause the control flow of conditional floating-point statements to deviate from the ideal flow of the real-number computation. This problem, which is called test instability, may result in a significant difference between the computation of a floating-point program and the expected output in real arithmetic. In this paper, a formally proven program transformation is proposed to detect and correct the effects of unstable tests. The output of this transformation is a floating-point program that is guaranteed to return either the result of the original floating-point program when it can be assured that both its real and its floating-point flows agree or a warning when these flows may diverge. The proposed approach is illustrated with the transformation of the core computation of a polygon containment algorithm developed at NASA that is used in a geofencing system for unmanned aircraft systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.