| 2009 |
|---|
| 18 | EE | Étienne Payet,
Frédéric Mesnard:
A non-termination criterion for binary constraint logic programs.
TPLP 9(2): 145-164 (2009) |
| 2008 |
|---|
| 17 | EE | Étienne Payet,
Frédéric Mesnard:
A Non-Termination Criterion for Binary Constraint Logic Programs
CoRR abs/0807.3451: (2008) |
| 16 | EE | Étienne Payet:
Loop detection in term rewriting using the eliminating unfoldings.
Theor. Comput. Sci. 403(2-3): 307-327 (2008) |
| 2007 |
|---|
| 15 | EE | Étienne Payet,
Fausto Spoto:
Magic-Sets Transformation for the Analysis of Java Bytecode.
SAS 2007: 452-467 |
| 2006 |
|---|
| 14 | EE | Étienne Payet:
Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator.
LOPSTR 2006: 194-209 |
| 13 | EE | Étienne Payet,
Frédéric Mesnard:
Nontermination inference of logic programs.
ACM Trans. Program. Lang. Syst. 28(2): 256-289 (2006) |
| 2005 |
|---|
| 12 | EE | Étienne Payet,
Frédéric Mesnard:
An Improved Non-Termination Criterion for Binary Constraint Logic Programs.
WLPE 2005: 46-60 |
| 11 | EE | Étienne Payet,
Frédéric Mesnard:
An Improved Non-Termination Criterion for Binary Constraint Logic Programs
CoRR abs/cs/0508106: (2005) |
| 2004 |
|---|
| 10 | | Étienne Payet,
Frédéric Mesnard:
Inférence de non-terminaison pour les programmes logiques avec contraintes.
JFPLC 2004 |
| 9 | EE | Étienne Payet,
Frédéric Mesnard:
Non-termination Inference for Constraint Logic Programs.
SAS 2004: 377-392 |
| 8 | EE | Étienne Payet,
Frédéric Mesnard:
Non-Termination Inference of Logic Programs
CoRR cs.PL/0406041: (2004) |
| 2002 |
|---|
| 7 | | Frédéric Mesnard,
Étienne Payet,
Ulrich Neumerkel:
Non-Termination Inference for Optimal Termination Conditions of Logic Programs.
JFPLC 2002: 87- |
| 6 | EE | Frédéric Mesnard,
Étienne Payet,
Ulrich Neumerkel:
Detecting Optimal Termination Conditions of Logic Programs.
SAS 2002: 509-526 |
| 5 | EE | Étienne Payet,
Frédéric Mesnard:
A Generalization of the Lifting Lemma for Logic Programming
CoRR cs.LO/0212026: (2002) |
| 2001 |
|---|
| 4 | | 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 |
| 2000 |
|---|
| 3 | | Étienne Payet:
Thue Specifications, Infinite Graphs and Synchronized Product.
Fundam. Inform. 44(3): 265-290 (2000) |
| 1999 |
|---|
| 2 | EE | Teodor Knapik,
Étienne Payet:
Synchronized Product of Linear Bounded Machines.
FCT 1999: 362-373 |
| 1998 |
|---|
| 1 | EE | Teodor Knapik,
Étienne Payet:
The Full Quotient and its Closure Property for Regular Languages.
Inf. Process. Lett. 65(2): 57-62 (1998) |
