Exact Real Computer Arithmetic with Continued Fractions
IEEE Transactions on Computers
Multiple specialization using minimal-function graph semantics
Journal of Logic Programming
PCF extended with real numbers
Theoretical Computer Science - Special issue on real numbers and computers
From logic programming to Prolog
From logic programming to Prolog
Termination analysis: some practical properties of the norm and level mapping space
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Constraint-based termination analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Asserting the Precision of Floating-Point Computations: A Simple Abstract Interpreter
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Abstracting Numerical Values in CLP(H, N)
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Static Analyses of the Precision of Floating-Point Operations
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
On Termination of Constraint Logic Programs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Inference of Termination Conditions for Numerical Loops in Prolog
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Semantics of Exact Real Arithmetic
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Inference of termination conditions for numerical loops in Prolog
Theory and Practice of Logic Programming
A termination analyzer for Java bytecode based on path-length
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
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.