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.
|Title of host publication||Proceedings of the 9th International Symposium on Static Analysis (SAS 2002), 17-20 September 2002, Madrid, Spain|
|Editors||M.V. Hermenegildo, G. Puebla|
|Place of Publication||Berlin|
|Publication status||Published - 2002|
|Name||Lecture Notes in Computer Science|