The Full Quotient and its Closure Property for Regular Languages. - Teodor Knapik; Étienne Payet (Inf. Process. Lett., 1998)

Synchronized Product of Linear Bounded Machines. - Teodor Knapik; Étienne Payet (FCT, 1999)

Thue Specifications, Infinite Graphs and Synchronized Product. - Étienne Payet (Fundam. Informaticae, 2000)

Produit Synchronisé pour Quelques Classes de Graphes Infinis. - Étienne Payet (2000)

cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog. - Frédéric Mesnard; Ulrich Neumerkel; Étienne Payet (JFPLC, 2001)

Non-Termination Inference for Optimal Termination Conditions of Logic Programs. - Frédéric Mesnard; Étienne Payet; Ulrich Neumerkel (JFPLC, 2002)

Detecting Optimal Termination Conditions of Logic Programs. - Frédéric Mesnard; Étienne Payet; Ulrich Neumerkel (SAS, 2002)

A Generalization of the Lifting Lemma for Logic Programming - Étienne Payet; Frédéric Mesnard (CoRR, 2002)

Inférence de non-terminaison pour les programmes logiques avec contraintes. - Étienne Payet; Frédéric Mesnard (JFPLC, 2004)

Non-termination Inference for Constraint Logic Programs. - Étienne Payet; Frédéric Mesnard (SAS, 2004)

Non-Termination Inference of Logic Programs - Étienne Payet; Frédéric Mesnard (CoRR, 2004)

An Improved Non-Termination Criterion for Binary Constraint Logic Programs. - Étienne Payet; Frédéric Mesnard (WLPE, 2005)

Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator. - Étienne Payet (LOPSTR, 2006)

Nontermination inference of logic programs. - Étienne Payet; Frédéric Mesnard (ACM Trans. Program. Lang. Syst., 2006)

Magic-Sets Transformation for the Analysis of Java Bytecode. - Étienne Payet; Fausto Spoto (SAS, 2007)

Loop detection in term rewriting using the eliminating unfoldings. - Étienne Payet (Theor. Comput. Sci., 2008)

Experiments with Non-Termination Analysis for Java Bytecode. - Étienne Payet; Fausto Spoto (BYTECODE@ETAPS, 2009)

A non-termination criterion for binary constraint logic programs. - Étienne Payet; Frédéric Mesnard (Theory Pract. Log. Program., 2009)

Magic-sets for localised analysis of Java bytecode. - Fausto Spoto; Étienne Payet (High. Order Symb. Comput., 2010)

A termination analyzer for Java bytecode based on path-length. - Fausto Spoto; Fred Mesnard; Étienne Payet (ACM Trans. Program. Lang. Syst., 2010)

Static analysis of Android programs. - Étienne Payet; Fausto Spoto (Inf. Softw. Technol., 2012)

An operational semantics for android activities. - Étienne Payet; Fausto Spoto (PEPM, 2014)

Non-termination of Dalvik bytecode via compilation to CLP. - Étienne Payet; Frédéric Mesnard (CoRR, 2014)

Non-Termination Analysis of Java Bytecode. - Étienne Payet; Fred Mesnard; Fausto Spoto (CoRR, 2014)

A second-order formulation of non-termination. - Fred Mesnard; Étienne Payet (Inf. Process. Lett., 2015)

Concolic testing in logic programming. - Fred Mesnard; Étienne Payet; Germán Vidal (Theory Pract. Log. Program., 2015)

On the Completeness of Selective Unification in Concolic Testing of Logic Programs. - Fred Mesnard; Étienne Payet; Germán Vidal (LOPSTR, 2016)

Towards a framework for algorithm recognition in binary code. - Frédéric Mesnard; Étienne Payet; Wim Vanhoof (PPDP, 2016)

Termination analysis of floating-point programs using parameterizable rational approximations. - Fonenantsoa Maurica; Frédéric Mesnard; Étienne Payet (SAC, 2016)

On the Linear Ranking Problem for Simple Floating-Point Loops. - Fonenantsoa Maurica; Frédéric Mesnard; Étienne Payet (SAS, 2016)

Checking Array Bounds by Abstract Interpretation and Symbolic Expressions. - Étienne Payet; Fausto Spoto (IJCAR, 2018)

Guided Unfoldings for Finding Loops in Standard Term Rewriting. - Étienne Payet (LOPSTR, 2018)

An SMT-Based Concolic Testing Tool for Logic Programs. - Sophie Fortz; Fred Mesnard; Étienne Payet; Gilles Perrouin; Wim Vanhoof; Germán Vidal (FLOPS, 2020)

Selective Unification in (Constraint) Logic Programming. - Fred Mesnard; Étienne Payet; Germán Vidal (Fundam. Informaticae, 2020)

Concolic Testing in CLP. - Fred Mesnard; Étienne Payet; Germán Vidal (Theory Pract. Log. Program., 2020)

On the Termination of Borrow Checking in Featherweight Rust. - Étienne Payet; David J. Pearce 001; Fausto Spoto (NFM, 2022)

Binary Non-Termination in Term Rewriting and Logic Programming. - Étienne Payet (CoRR, 2023)

The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions. - Akihisa Yamada 002; Benjamin Lucien Kaminski; Dieter Hofbauer; Fred Mesnard; Étienne Payet (CoRR, 2023)

Automated Theorem Proving for Prolog Verification. - Fred Mesnard; Thierry Marianne; Étienne Payet (LPAR Complementary Volume, 2024)

Non-termination in Term Rewriting and Logic Programming. - Étienne Payet (J. Autom. Reason., 2024)

Non-Termination of Logic Programs Using Patterns. - Étienne Payet (CoRR, 2025)