Non-termination analysis of logic programs using types

Authors:
Dean Voets;Danny De Schreye
Affiliations:
Department of Computer Science, K.U. Leuven, Belgium, Heverlee;Department of Computer Science, K.U. Leuven, Belgium, Heverlee
Venue:
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Year:
2010

Citing 7
Cited 1

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
A type system for logic program

Journal of Logic Programming
Logic Program Specialisation

Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
Nontermination inference of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
A New Approach to Non-termination Analysis of Logic Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Termination prediction for general logic programs

Theory and Practice of Logic Programming
Inference of well-typings for logic programs with application to termination analysis

SAS'05 Proceedings of the 12th international conference on Static Analysis

Non-termination analysis and cost-based query optimization of logic programs

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years techniques and systems have been developed to prove non-termination of logic programs for certain classes of queries. In previous work, we developed such a system based on mode-information and a form of loop checking performed at compile time. In the current paper we improve this technique by integrating type information in the analysis and by applying non-failure analysis and program specialization. It turns out that there are several classes of programs for which existing non-termination analyzers fail and for which our extended technique succeeds in proving non-termination.