Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Prolog programming for artificial intelligence
Prolog programming for artificial intelligence
Efficient tests for top-down termination of logical rules
Journal of the ACM (JACM)
The craft of Prolog
Termination proofs for logic programs based on predicate inequalities
Logic programming
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
Norms on terms and their use in proving universal termination of a logic program
Theoretical Computer Science
Effectiveness of global analysis in strict independence-based automatic parallelization
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
From logic programming to Prolog
From logic programming to Prolog
Automatic generation of invariants and intermediate assertions
Theoretical Computer Science - Special issue: principles and practice of constraint programming
An extended variant of atoms loop check for positive logic programs
New Generation Computing
An abstract approach to some loop detection problems
Fundamenta Informaticae
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)
Termination proofs for logic programs with tabling
ACM Transactions on Computational Logic (TOCL)
Loop checks for logic programs with functions
Theoretical Computer Science
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On proving left termination of constraint logic programs
ACM Transactions on Computational Logic (TOCL)
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
Combining Norms to Prove Termination
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
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)
Reuse of Results in Termination Analysis of Typed Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Detecting Optimal Termination Conditions of Logic Programs
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
On Termination of Logic Programs with Floating Point Computations
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
Practical Methods for Proving Program Termination
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Preserving Universal Termination through Unfold/Fold
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
TermiLog: A System for Checking Termination of Queries to Logic Programs
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
On modular termination proofs of general logic programs
Theory and Practice of Logic Programming
Termination of Floating-Point Computations
Journal of Automated Reasoning
Proving Termination of Integer Term Rewriting
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
Automated termination analysis for logic programs by term rewriting
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
On termination of binary CLP programs
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
| Hi-index | 0.00 |
We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the integers. We present a technique that allows overcoming these difficulties. Our approach is based on transforming a program in a way that allows integrating and extending techniques originally developed for analysis of numerical computations in the framework of query-mapping pairs with the well-known framework of acceptability. Such an integration not only contributes to the understanding of termination behaviour of numerical computations, but also allows us to perform a correct analysis of such computations automatically, by extending previous work on a constraint-based approach to termination. Finally, we discuss possible extensions of the technique, including incorporating general term orderings.