Étienne Payet

56 papers A 2B 6C 8Misc 2Journal 30Unranked 7
YearRankTypeTitle / Venue / Authors
2025 C conf
Automated Certification of Logic Program Groundness Analysis.
LOPSTR
Thierry Marianne, Fred Mesnard, Étienne Payet
2025 B conf
Automated Theorem Proving for Prolog Verification.
ICLP
Fred Mesnard, Thierry Marianne, Étienne Payet
2025 J jnl
Non-Termination of Logic Programs Using Patterns.
CoRR
Étienne Payet
2025 J jnl
Non-Termination of Logic Programs Using Patterns.
Theory Pract. Log. Program.
Étienne Payet
2025 C conf
Recurrent Pairs Revisited.
LOPSTR
Étienne Payet
2024 — conf
Automated Theorem Proving for Prolog Verification.
LPAR Complementary Volume
Fred Mesnard, Thierry Marianne, Étienne Payet
2024 J jnl
Non-termination in Term Rewriting and Logic Programming.
J. Autom. Reason.
Étienne Payet
2023 J jnl
Binary Non-Termination in Term Rewriting and Logic Programming.
CoRR
Étienne Payet
2023 J jnl
Non-Termination in Term Rewriting and Logic Programming.
CoRR
Étienne Payet
2023 J jnl
The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions.
CoRR
Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer, Fred Mesnard, Étienne Payet
2022 — conf
On the Termination of Borrow Checking in Featherweight Rust.
NFM
Étienne Payet, David J. Pearce, Fausto Spoto
2020 Misc conf
An SMT-Based Concolic Testing Tool for Logic Programs.
FLOPS
Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal
2020 J jnl
An SMT-Based Concolic Testing Tool for Logic Programs.
CoRR
Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal
2020 J jnl
Concolic Testing in CLP.
CoRR
Fred Mesnard, Étienne Payet, Germán Vidal
2020 J jnl
Concolic Testing in CLP.
Theory Pract. Log. Program.
Fred Mesnard, Étienne Payet, Germán Vidal
2020 J jnl
Selective Unification in (Constraint) Logic Programming.
Fundam. Informaticae
Fred Mesnard, Étienne Payet, Germán Vidal
2018 A conf
Checking Array Bounds by Abstract Interpretation and Symbolic Expressions.
IJCAR
Étienne Payet, Fausto Spoto
2018 C conf
Guided Unfoldings for Finding Loops in Standard Term Rewriting.
LOPSTR
Étienne Payet
2018 J jnl
Guided Unfoldings for Finding Loops in Standard Term Rewriting.
CoRR
Étienne Payet
2017 C conf
Selective unification in constraint logic programming.
PPDP
Fred Mesnard, Étienne Payet, Germán Vidal
2016 C conf
On the Completeness of Selective Unification in Concolic Testing of Logic Programs.
LOPSTR
Fred Mesnard, Étienne Payet, Germán Vidal
2016 J jnl
On the Completeness of Selective Unification in Concolic Testing of Logic Programs.
CoRR
Fred Mesnard, Étienne Payet, Germán Vidal
2016 B conf
On the Linear Ranking Problem for Simple Floating-Point Loops.
SAS
Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet
2016 Misc conf
Termination analysis of floating-point programs using parameterizable rational approximations.
SAC
Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet
2016 C conf
Towards a framework for algorithm recognition in binary code.
PPDP
Frédéric Mesnard, Étienne Payet, Wim Vanhoof
2015 J jnl
A second-order formulation of non-termination.
Inf. Process. Lett.
Fred Mesnard, Étienne Payet
2015 J jnl
Concolic Testing in Logic Programming.
CoRR
Fred Mesnard, Étienne Payet, Germán Vidal
2015 J jnl
Concolic testing in logic programming.
Theory Pract. Log. Program.
Fred Mesnard, Étienne Payet, Germán Vidal
2014 J jnl
A Second-Order Formulation of Non-Termination.
CoRR
Fred Mesnard, Étienne Payet
2014 C conf
An operational semantics for android activities.
PEPM
Étienne Payet, Fausto Spoto
2014 J jnl
Non-Termination Analysis of Java Bytecode.
CoRR
Étienne Payet, Fred Mesnard, Fausto Spoto
2014 J jnl
Non-termination of Dalvik bytecode via compilation to CLP.
CoRR
Étienne Payet, Frédéric Mesnard
2012 J jnl
Static analysis of Android programs.
Inf. Softw. Technol.
Étienne Payet, Fausto Spoto
2011 A conf
Static Analysis of Android Programs.
CADE
Étienne Payet, Fausto Spoto
2010 J jnl
A termination analyzer for Java bytecode based on path-length.
ACM Trans. Program. Lang. Syst.
Fausto Spoto, Fred Mesnard, Étienne Payet
2010 J jnl
Magic-sets for localised analysis of Java bytecode.
High. Order Symb. Comput.
Fausto Spoto, Étienne Payet
2009 J jnl
A non-termination criterion for binary constraint logic programs.
Theory Pract. Log. Program.
Étienne Payet, Frédéric Mesnard
2009 — conf
Experiments with Non-Termination Analysis for Java Bytecode.
BYTECODE@ETAPS
Étienne Payet, Fausto Spoto
2008 J jnl
A Non-Termination Criterion for Binary Constraint Logic Programs
CoRR
Étienne Payet, Frédéric Mesnard
2008 J jnl
Loop detection in term rewriting using the eliminating unfoldings.
Theor. Comput. Sci.
Étienne Payet
2007 B conf
Magic-Sets Transformation for the Analysis of Java Bytecode.
SAS
Étienne Payet, Fausto Spoto
2006 C conf
Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator.
LOPSTR
Étienne Payet
2006 J jnl
Nontermination inference of logic programs.
ACM Trans. Program. Lang. Syst.
Étienne Payet, Frédéric Mesnard
2005 J jnl
An Improved Non-Termination Criterion for Binary Constraint Logic Programs
CoRR
Étienne Payet, Frédéric Mesnard
2005 — conf
An Improved Non-Termination Criterion for Binary Constraint Logic Programs.
WLPE
Étienne Payet, Frédéric Mesnard
2004 — conf
Inférence de non-terminaison pour les programmes logiques avec contraintes.
JFPLC
Étienne Payet, Frédéric Mesnard
2004 J jnl
Non-Termination Inference of Logic Programs
CoRR
Étienne Payet, Frédéric Mesnard
2004 B conf
Non-termination Inference for Constraint Logic Programs.
SAS
Étienne Payet, Frédéric Mesnard
2002 J jnl
A Generalization of the Lifting Lemma for Logic Programming
CoRR
Étienne Payet, Frédéric Mesnard
2002 B conf
Detecting Optimal Termination Conditions of Logic Programs.
SAS
Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel
2002 — conf
Non-Termination Inference for Optimal Termination Conditions of Logic Programs.
JFPLC
Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel
2001 — conf
cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog.
JFPLC
Frédéric Mesnard, Ulrich Neumerkel, Étienne Payet
2000 — —
Produit Synchronisé pour Quelques Classes de Graphes Infinis.
Étienne Payet
2000 J jnl
Thue Specifications, Infinite Graphs and Synchronized Product.
Fundam. Informaticae
Étienne Payet
1999 B conf
Synchronized Product of Linear Bounded Machines.
FCT
Teodor Knapik, Étienne Payet
1998 J jnl
The Full Quotient and its Closure Property for Regular Languages.
Inf. Process. Lett.
Teodor Knapik, Étienne Payet