Lecture Notes in Computer Science vol:2477 pages:151-164
The 9th International Static Analysis Symposium location:Madrid, Spain date:September 17-20, 2002
Numerical computations form an essential part of almost any real-world program. Traditional approaches to termination of logic programs are restricted to domains isomorphic to N, more recent works study termination of integer computations. Termination of computations involving real numbers is cumbersome and counter-intuitive due to rounding errors and implementation conventions. We present a novel technique that allows us to prove termination of such computations. Our approach extends the previous work on termination of integer computations.