| 2025 | LOPSTR | Automated Certification of Logic Program Groundness Analysis. | Thierry Marianne, Fred Mesnard, tienne Payet |
| 2025 | LOPSTR | Recurrent Pairs Revisited. | tienne Payet |
| 2024 | LPAR | Automated Theorem Proving for Prolog Verification. | Fred Mesnard, Thierry Marianne, tienne Payet |
| 2020 | FLOPS | An SMT-Based Concolic Testing Tool for Logic Programs. | Sophie Fortz, Fred Mesnard, tienne Payet, Gilles Perrouin, Wim Vanhoof, Germn Vidal |
| 2018 | CADE | Checking Array Bounds by Abstract Interpretation and Symbolic Expressions. | tienne Payet, Fausto Spoto |
| 2018 | LOPSTR | Guided Unfoldings for Finding Loops in Standard Term Rewriting. | tienne Payet |
| 2017 | PPDP | Selective unification in constraint logic programming. | Fred Mesnard, tienne Payet, Germn Vidal |
| 2016 | LOPSTR | On the Completeness of Selective Unification in Concolic Testing of Logic Programs. | Fred Mesnard, tienne Payet, Germn Vidal |
| 2016 | PPDP | Towards a framework for algorithm recognition in binary code. | Frdric Mesnard, tienne Payet, Wim Vanhoof |
| 2016 | SAC | Termination analysis of floating-point programs using parameterizable rational approximations. | Fonenantsoa Maurica, Frdric Mesnard, tienne Payet |
| 2016 | SAS | On the Linear Ranking Problem for Simple Floating-Point Loops. | Fonenantsoa Maurica, Frdric Mesnard, tienne Payet |
| 2014 | PEPM | An operational semantics for android activities. | tienne Payet, Fausto Spoto |
| 2011 | CADE | Static Analysis of Android Programs. | tienne Payet, Fausto Spoto |
| 2007 | SAS | Magic-Sets Transformation for the Analysis of Java Bytecode. | tienne Payet, Fausto Spoto |
| 2006 | LOPSTR | Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator. | tienne Payet |
| 2004 | SAS | Non-termination Inference for Constraint Logic Programs. | tienne Payet, Frdric Mesnard |
| 2002 | SAS | Detecting Optimal Termination Conditions of Logic Programs. | Frdric Mesnard, tienne Payet, Ulrich Neumerkel |
| 1999 | FCT | Synchronized Product of Linear Bounded Machines. | Teodor Knapik, tienne Payet |