[Mesnard93] F. Mesnard,
Etude de la terminaison des programmes logiques avec contraintes,
au moyen d'approximations,
PhD thesis, Université Paris VI, 1993.
[Mesnard96] F. Mesnard,
Inferring
left-terminating classes of queries for constraint logic
programs by means of approximations.
In M. J. Maher, editor,
Logic Programming: Proceedings of the Joint International
Conference and Symposium on Logic Programming, MIT Press Series in Logic
Programming, Bonn, Germany, 1996. The MIT Press. Pages 7-21.
[NeumerkelM99] U. Neumerkel and F. Mesnard,
Localizing
and explaining reasons for non-terminating logic programs
with failure-slices.
In G. Nadathur, editor,
Principles and Practice of Declarative Programming,
volume 1702 of Lecture Notes in Computer Science, Paris, France, 1999.
Springer-Verlag, Berlin. Pages 328-341.
[MesnardN01] F. Mesnard and U. Neumerkel,
Applying
static analysis techniques for inferring termination conditions
of logic programs.
In P. Cousot, editor,
Static Analysis: 8th International Symposium, SAS 2001,
volume 2126 of Lecture Notes in Computer Science,
Paris, France, 2001. Pages 93-110.
[MesnardPN02] F. Mesnard, E. Payet, and U. Neumerkel,
Detecting
optimal termination conditions of logic programs.
In M. V. Hermenegildo and G. Puebla, editors,
Static Analysis: 9th International Symposium, SAS 2002,
volume 2477 of Lecture Notes in Computer Science, Madrid, Spain, 2002.
Springer-Verlag, Berlin. Pages 509-525.
[MesnardR03] F. Mesnard and S. Ruggieri,
On proving
left termination of constraint logic programs.
ACM Transactions on Computational Logic, 4(2):1-26, 2003.
Related Systems
TermiLog:
Termination analyzer by Naomi
Lindenstrauss
(here without
frames).
TerminWeb:
Termination analyser by Michael
Codish,
Samir Genaim,
and Cohavit Taboch.
LPTP: A Logic Program Theorem Prover (proving left termination and other
properties)
by Robert Stärk.
Ciao:
Prolog development system with an
upper-bound complexity analyzer
(upper-bound complexity analysis encompasses termination analysis).
Mercury
contains a
termination
analyser
(see the
manual).
TALP: Automatic termination proofs for well-moded logic programs.
[Page last updated on January 20, 2013, 16:47:51.]