Sébastien Hoarau

Learn More
This paper presents an automated method that deals with termination of constraint logic programs in two steps. First, the method infers a set of potentially terminating classes (using approximation techniques and boolean mu-calculus). By \potentially", we mean that for each of these classes, one can nd a static order over the literals of the clauses of the(More)
We present cTI, a system for bottom-up termination inference. Termination inference is a generalization of termination analy-sis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiring user annotations. With termination inference such annotations are not(More)
Ce papier présente une méthode automatisée qui traite en deux étapes la terminaison de programmes logiques contraints. Dans un premier temps, et en utilisant des techniques d’approximations de programmes et de mu-calcul sur les booléens, la méthode infère un ensemble de classes de requêtes sûres. Par “sûres”, nous entendons que pour chacune de ces classes(More)
Various proof methods have been proposed to solve the implication problem , i.e. proving that properties of the form : 8(P ! Q)-where P and Q denote conjunctions of atoms-are logical consequences of logic programs. Nonetheless, it is a commonplace to say that it is still quite a diicult problem. Besides, the advent of the constraint logic programming scheme(More)
  • 1