Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Efficient tests for top-down termination of logical rules
Journal of the ACM (JACM)
Exact Real Computer Arithmetic with Continued Fractions
IEEE Transactions on Computers
What every computer scientist should know about floating-point arithmetic
ACM Computing Surveys (CSUR)
Termination detection in logic programs using argument sizes (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Multiple specialization using minimal-function graph semantics
Journal of Logic Programming
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Mixtus: an automatic partial evaluator for full Prolog
New Generation Computing
Handling floating-point exceptions in numeric programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Controlling generalization and polyvariance in partial deduction of normal logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Refinement of rational end-points real numbers by means of floating-point numbers
Science of Computer Programming
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Constraint-based termination analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Advanced Computer Arithmetic Design
Advanced Computer Arithmetic Design
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
Asserting the Precision of Floating-Point Computations: A Simple Abstract Interpreter
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Termination of Constraint Logic Programs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Abstracting Numerical Values in CLP(H, N)
PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
Synthesis of Linear Ranking Functions
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Proving Termination of Logic Programs by Exploiting Term Properties
TAPSOFT '91 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD)
Pos(T): Analyzing Dependencies in Typed Logic Programs
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Proving Termination of Constraint Solver Programs
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Verification of Embedded Software: Problems and Perspectives
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Reuse of Results in Termination Analysis of Typed Logic Programs
SAS '02 Proceedings of the 9th 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
Abstract specialization and its applications
Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
A static analyzer for large safety-critical software
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Semantics of Exact Real Arithmetic
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Classes of terminating logic programs
Theory and Practice of Logic Programming
Inference of termination conditions for numerical loops in Prolog
Theory and Practice of Logic Programming
Proposal to eliminate denormalized numbers
ACM SIGNUM Newsletter
Draft proposal for a binary normalized floating point standard
ACM SIGNUM Newsletter
Numerica: a modeling language for global optimization
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
| 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 (驴,); more recent works study termination of integer computations where the lack of well-foundedness of the integers has to be taken into account. Termination of computations involving floating-point numbers can be counterintuitive because of 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.