| 2009 |
|---|
| 45 | EE | Étienne Payet,
Frédéric Mesnard:
A non-termination criterion for binary constraint logic programs.
TPLP 9(2): 145-164 (2009) |
| 2008 |
|---|
| 44 | EE | Salvatore Ruggieri,
Frédéric Mesnard:
Typing Linear Constraints for Moding CLP() Programs.
SAS 2008: 128-143 |
| 43 | EE | Étienne Payet,
Frédéric Mesnard:
A Non-Termination Criterion for Binary Constraint Logic Programs
CoRR abs/0807.3451: (2008) |
| 42 | EE | Frédéric Mesnard,
Alexander Serebrenik:
Recurrence with affine level mappings is P-time decidable for CLP(R).
TPLP 8(1): 111-119 (2008) |
| 2007 |
|---|
| 41 | EE | Frédéric Mesnard,
Alexander Serebrenik:
Recurrence with affine level mappings is P-time decidable for CLP(R)
CoRR abs/cs/0701082: (2007) |
| 2006 |
|---|
| 40 | EE | Étienne Payet,
Frédéric Mesnard:
Nontermination inference of logic programs.
ACM Trans. Program. Lang. Syst. 28(2): 256-289 (2006) |
| 2005 |
|---|
| 39 | EE | Étienne Payet,
Frédéric Mesnard:
An Improved Non-Termination Criterion for Binary Constraint Logic Programs.
WLPE 2005: 46-60 |
| 38 | EE | Étienne Payet,
Frédéric Mesnard:
An Improved Non-Termination Criterion for Binary Constraint Logic Programs
CoRR abs/cs/0508106: (2005) |
| 37 | EE | Frédéric Mesnard,
Roberto Bagnara:
cTI: A constraint-based termination inference tool for ISO-Prolog.
TPLP 5(1-2): 243-257 (2005) |
| 36 | EE | Florence Benoy,
Andy King,
Frédéric Mesnard:
Computing convex hulls with a linear solver.
TPLP 5(1-2): 259-271 (2005) |
| 2004 |
|---|
| 35 | | Frédéric Mesnard:
Programmation en logique avec contraintes, JFPLC 2004, 21, 22 et 23 Juin 2004, Angers, France
Hermes 2004 |
| 34 | | Étienne Payet,
Frédéric Mesnard:
Inférence de non-terminaison pour les programmes logiques avec contraintes.
JFPLC 2004 |
| 33 | EE | Alexander Serebrenik,
Frédéric Mesnard:
On Termination of Binary CLP Programs.
LOPSTR 2004: 231-244 |
| 32 | EE | Étienne Payet,
Frédéric Mesnard:
Non-termination Inference for Constraint Logic Programs.
SAS 2004: 377-392 |
| 31 | EE | Étienne Payet,
Frédéric Mesnard:
Non-Termination Inference of Logic Programs
CoRR cs.PL/0406041: (2004) |
| 2003 |
|---|
| 30 | | Frédéric Mesnard,
Alexander Serebrenik:
Proceedings of the 13th International Workshop on Logic Programming Environments, Tata Institute of Fundamental Research, Mumbai, India, December 8, 2003
Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan 200A, B-3001 Heverlee (Belgium) 2003 |
| 29 | EE | Vitaly Lagoon,
Frédéric Mesnard,
Peter J. Stuckey:
Termination Analysis with Types Is More Accurate.
ICLP 2003: 254-268 |
| 28 | EE | Frédéric Mesnard,
Salvatore Ruggieri:
On proving left termination of constraint logic programs.
ACM Trans. Comput. Log. 4(2): 1-26 (2003) |
| 27 | EE | Frédéric Mesnard,
Salvatore Ruggieri:
On proving left termination of constraint logic programs.
ACM Trans. Comput. Log. 4(2): 207-259 (2003) |
| 26 | EE | Frédéric Mesnard,
Roberto Bagnara:
cTI: A constraint-based termination inference tool for ISO-Prolog
CoRR cs.PL/0309028: (2003) |
| 25 | EE | Florence Benoy,
Andy King,
Frédéric Mesnard:
Computing Convex Hulls with a Linear Solver
CoRR cs.PL/0311002: (2003) |
| 2002 |
|---|
| 24 | | Frédéric Mesnard,
Étienne Payet,
Ulrich Neumerkel:
Non-Termination Inference for Optimal Termination Conditions of Logic Programs.
JFPLC 2002: 87- |
| 23 | EE | Frédéric Mesnard,
Étienne Payet,
Ulrich Neumerkel:
Detecting Optimal Termination Conditions of Logic Programs.
SAS 2002: 509-526 |
| 22 | EE | Étienne Payet,
Frédéric Mesnard:
A Generalization of the Lifting Lemma for Logic Programming
CoRR cs.LO/0212026: (2002) |
| 2001 |
|---|
| 21 | | Frédéric Mesnard,
Ulrich Neumerkel,
Étienne Payet:
cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog.
JFPLC 2001: 271-286 |
| 20 | EE | Frédéric Mesnard,
Ulrich Neumerkel:
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs.
SAS 2001: 93-110 |
| 2000 |
|---|
| 19 | | Serge Burckel,
Sébastien Hoarau,
Frédéric Mesnard,
Ulrich Neumerkel:
cTI: Bottom-Up Termination Inference for Logic Programs.
15. WLP 2000: 123-134 |
| 18 | | Frédéric Mesnard,
Antoine Rauzy:
Le iota-calcul: un langage de contraintes d'ordre supérieur.
JFPLC 2000: 241- |
| 17 | | Stefan Kral,
Frédéric Mesnard,
Ulrich Neumerkel:
Slicing zur Fehlersuche in Logikprogrammen.
WLP 2000: 241-243 |
| 1999 |
|---|
| 16 | | Serge Colin,
Frédéric Mesnard,
Antoine Rauzy:
Un module Prolog de mu-calcul booléen: une réalisation par BDD.
JFPLC 1999: 23-38 |
| 15 | | Ulrich Neumerkel,
Frédéric Mesnard:
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices.
PPDP 1999: 328-342 |
| 1998 |
|---|
| 14 | | Sébastien Hoarau,
Frédéric Mesnard:
Inférer et compiler la terminaison des programmes logiques avec contraintes.
JFPLC 1998: 269-286 |
| 13 | EE | Sébastien Hoarau,
Frédéric Mesnard:
Inferring and Compiling Termination for Constraint Logic Programs.
LOPSTR 1998: 240-254 |
| 12 | | Frédéric Mesnard,
Sébastien Hoarau,
Alexandra Maillard:
CLP(chi) for Automatically Proving Program Properties.
J. Log. Program. 37(1-3): 77-93 (1998) |
| 1996 |
|---|
| 11 | | Frédéric Mesnard,
Sébastien Hoarau,
Alexandra Maillard:
CLP(chi) for Proving Program Properties.
Frontiers of Combining Systems (FroCos) 1996: 321-338 |
| 10 | | Sébastien Hoarau,
Frédéric Mesnard:
PLC(Bool) pour la détection de variables numériques bornées.
JFPLC 1996: 169-184 |
| 9 | | Frédéric Mesnard:
Inferring Left-terminating Classes of Queries for Constraint Logic Programs.
JICSLP 1996: 7-21 |
| 1995 |
|---|
| 8 | | Frédéric Mesnard,
Sébastien Hoarau:
Contrôle dynamique de la résolution pour les programmes logiques avec contraintes.
JFPLC 1995: 259-273 |
| 7 | | Frédéric Mesnard:
Towards Automatic Control for CLP(x) Programs.
LOPSTR 1995: 106-119 |
| 1994 |
|---|
| 6 | | Frédéric Mesnard:
Étude de la terminaison des programmes logiques avec contraintes au moyen d'approximations.
JFPLC 1994: 205- |
| 1993 |
|---|
| 5 | | Frédéric Mesnard:
Approximations entre langages de programmation logique avec contraintes.
JFPL 1993: 319-341 |
| 1992 |
|---|
| 4 | | Frédéric Mesnard,
Jean-Gabriel Ganascia:
CLP(X) for proving prgram properties.
JFPL 1992: 328- |
| 3 | | Frédéric Mesnard,
Jean-Gabriel Ganascia:
CLP(Q) for Proving Interargument Relations.
META 1992: 308-320 |
| 2 | | Frédéric Mesnard,
Marianne Morillon:
Automatic Generation of Valid Linear Measures for CLP(Q) Programs.
WSA 1992: 29-34 |
| 1991 |
|---|
| 1 | | Frédéric Mesnard,
Jean-Gabriel Ganascia:
A propos du contrôle de la résolution.
JTASPEFT/WSA 1991: 125-131 |
