Search the dblp DataBase

Publications of Author

1. Teodor Knapik, Étienne Payet
   Synchronized Product of Linear Bounded Machines. [Citation Graph (0, 0)][DBLP]
   FCT, 1999, pp:362-373 [Conf]
   
2. Frédéric Mesnard, Ulrich Neumerkel, Étienne Payet
   cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog. [Citation Graph (0, 0)][DBLP]
   JFPLC, 2001, pp:271-286 [Conf]
   
3. Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel
   Non-Termination Inference for Optimal Termination Conditions of Logic Programs. [Citation Graph (0, 0)][DBLP]
   JFPLC, 2002, pp:87-0 [Conf]
   
4. Étienne Payet, Frédéric Mesnard
   Inférence de non-terminaison pour les programmes logiques avec contraintes. [Citation Graph (0, 0)][DBLP]
   JFPLC, 2004, pp:- [Conf]
   
5. Étienne Payet
   Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator. [Citation Graph (0, 0)][DBLP]
   LOPSTR, 2006, pp:194-209 [Conf]
   
6. Étienne Payet, Frédéric Mesnard
   An Improved Non-Termination Criterion for Binary Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
   WLPE, 2005, pp:46-60 [Conf]
   
7. Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel
   Detecting Optimal Termination Conditions of Logic Programs. [Citation Graph (0, 0)][DBLP]
   SAS, 2002, pp:509-526 [Conf]
   
8. Étienne Payet, Frédéric Mesnard
   Non-termination Inference for Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
   SAS, 2004, pp:377-392 [Conf]
   
9. Étienne Payet, Frédéric Mesnard
   A Generalization of the Lifting Lemma for Logic Programming [Citation Graph (0, 0)][DBLP]
   CoRR, 2002, v:0, n:, pp:- [Journal]
   
10. Étienne Payet, Frédéric Mesnard
    Non-Termination Inference of Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
    
11. Étienne Payet
    Thue Specifications, Infinite Graphs and Synchronized Product. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:44, n:3, pp:265-290 [Journal]
    
12. Teodor Knapik, Étienne Payet
    The Full Quotient and its Closure Property for Regular Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:2, pp:57-62 [Journal]
    
13. Étienne Payet, Frédéric Mesnard
    Nontermination inference of logic programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2006, v:28, n:2, pp:256-289 [Journal]
    
14. Étienne Payet, Fausto Spoto
    Magic-Sets Transformation for the Analysis of Java Bytecode. [Citation Graph (0, 0)][DBLP]
    SAS, 2007, pp:452-467 [Conf]
    
15. 
    An Improved Non-Termination Criterion for Binary Constraint Logic Programs [Citation Graph (, )][DBLP]
    
    
16. 
    A Non-Termination Criterion for Binary Constraint Logic Programs [Citation Graph (, )][DBLP]
    
    
17. 
    Experiments with Non-Termination Analysis for Java Bytecode. [Citation Graph (, )][DBLP]