Research Summary: Non-termination Analysis of Logic Programs

Authors:
Dean Voets
Affiliations:
Department of Computer Science, K.U. Leuven, Belgium
Venue:
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Year:
2009

Citing 4
Cited 0

A practical framework for the abstract interpretation of logic programs

Journal of Logic Programming
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important advantage of Logic Programming (LP) is that a declarative programming style leads to more understandable and less error-prone computations. However, a declarative programming style also leads to less efficient, and in the extreme case, in non-terminating computations. Therefore, an important aspect of proving correctness of a program, is the analysis of the termination behavior of the program for a class of queries.