Treffer: Non-termination inference for constraint logic programs

Title:
Non-termination inference for constraint logic programs
Authors:
PAYET, Etienne, MESNARD, Fred
Source:
SAS 2004 : static analysis (Verona, 26-28 August 2004)Lecture notes in computer science. :377-392
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Génie logiciel, Software engineering, Inférence, Inference, Inferencia, Interrogation base donnée, Database query, Interrogación base datos, PROLOG, Problème terminaison, Termination problem, Problema terminación, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programmation logique, Logical programming, Programación lógica, Règle sélection, Selection rule, Regla selección, Vérification programme, Program verification, Verificación programa, Analyse statique, Static analysis, Análisis estática
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
IREMIA - Université de La Réunion, Reunion
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=16144053
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16144053
Database:
PASCAL Archive

Weitere Informationen

Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given class of queries, i.e. finiteness of all the possible derivations produced by a Prolog engine from any query in that class. In contrast, the study of the dual problem: non-termination w.r.t. the left selection rule i.e the existence of one query in a given class of queries which admits an infinite left derivation, has given rise to only a few papers. In this article, we study non-termination in the more general constraint logic programming framework. We rephrase our previous logic programming approach into this more abstract setting, which leads to a criterion expressed in a logical way and simpler proofs, as expected. Also, by reconsidering our previous work, we now prove that in some sense, we already had the best syntactic criterion for logic programming. Last but not least, we offer a set of correct algorithms for inferring non-termination for CLP.