A propos du contrôle de la résolution. - Frédéric Mesnard; Jean-Gabriel Ganascia (JTASPEFT/WSA, 1991)

CLP(X) for proving prgram properties. - Frédéric Mesnard; Jean-Gabriel Ganascia (JFPL, 1992)

CLP(Q) for Proving Interargument Relations. - Frédéric Mesnard; Jean-Gabriel Ganascia (META, 1992)

Automatic Generation of Valid Linear Measures for CLP(Q) Programs. - Frédéric Mesnard; Marianne Morillon (WSA, 1992)

Approximations entre langages de programmation logique avec contraintes. - Frédéric Mesnard (JFPL, 1993)

Étude de la terminaison des programmes logiques avec contraintes au moyen d'approximations. - Frédéric Mesnard (JFPLC, 1994)

Contrôle dynamique de la résolution pour les programmes logiques avec contraintes. - Frédéric Mesnard; Sébastien Hoarau (JFPLC, 1995)

Towards Automatic Control for CLP(x) Programs. - Frédéric Mesnard (LOPSTR, 1995)

CLP(chi) for Proving Program Properties. - Frédéric Mesnard; Sébastien Hoarau; Alexandra Maillard (FroCoS, 1996)

Inferring Left-terminating Classes of Queries for Constraint Logic Programs. - Frédéric Mesnard (JICSLP, 1996)

PLC(Bool) pour la détection de variables numériques bornées. - Sébastien Hoarau; Frédéric Mesnard (JFPLC, 1996)

Inférer et compiler la terminaison des programmes logiques avec contraintes. - Sébastien Hoarau; Frédéric Mesnard (JFPLC, 1998)

Inferring and Compiling Termination for Constraint Logic Programs. - Sébastien Hoarau; Frédéric Mesnard (LOPSTR, 1998)

CLP(chi) for Automatically Proving Program Properties. - Frédéric Mesnard; Sébastien Hoarau; Alexandra Maillard (J. Log. Program., 1998)

Un module Prolog de mu-calcul booléen: une réalisation par BDD. - Serge Colin; Frédéric Mesnard; Antoine Rauzy (JFPLC, 1999)

Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices. - Ulrich Neumerkel; Frédéric Mesnard (PPDP, 1999)

Le iota-calcul: un langage de contraintes d'ordre supérieur. - Frédéric Mesnard; Antoine Rauzy (JFPLC, 2000)

cTI: Bottom-Up Termination Inference for Logic Programs. - Serge Burckel; Sébastien Hoarau; Frédéric Mesnard; Ulrich Neumerkel (WLP, 2000)

Slicing zur Fehlersuche in Logikprogrammen. - Stefan Kral; Frédéric Mesnard; Ulrich Neumerkel (WLP, 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)

Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs. - Frédéric Mesnard; Ulrich Neumerkel (SAS, 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)

Termination Analysis with Types Is More Accurate. - Vitaly Lagoon; Frédéric Mesnard; Peter J. Stuckey (ICLP, 2003)

On proving left termination of constraint logic programs. - Frédéric Mesnard; Salvatore Ruggieri (ACM Trans. Comput. Log., 2003)

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

On Termination of Binary CLP Programs. - Alexander Serebrenik; Frédéric Mesnard (LOPSTR, 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)

Computing convex hulls with a linear solver. - Florence Benoy; Andy King; Frédéric Mesnard (Theory Pract. Log. Program., 2005)

cTI: A constraint-based termination inference tool for ISO-Prolog. - Frédéric Mesnard; Roberto Bagnara (Theory Pract. Log. Program., 2005)

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

Typing Linear Constraints for Moding CLP() Programs. - Salvatore Ruggieri; Frédéric Mesnard (SAS, 2008)

Recurrence with affine level mappings is P-time decidable for CLP(R). - Frédéric Mesnard; Alexander Serebrenik (Theory Pract. Log. Program., 2008)

Using CLP Simplifications to Improve Java Bytecode Termination Analysis. - Fausto Spoto; Lunjin Lu; Fred Mesnard (BYTECODE@ETAPS, 2009)

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

Variable ranges in linear constraints. - Salvatore Ruggieri; Fred Mesnard (SAC, 2010)

The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version - Roberto Bagnara; Fred Mesnard; Andrea Pescetti; Enea Zaffanella (CoRR, 2010)

Typing linear constraints. - Salvatore Ruggieri; Fred Mesnard (ACM Trans. Program. Lang. Syst., 2010)

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

A new look at the automatic synthesis of linear ranking functions. - Roberto Bagnara; Fred Mesnard; Andrea Pescetti; Enea Zaffanella (Inf. Comput., 2012)

Effects of Melting Layer in Airborne Meteorological X-Band Radar Observations. - Olivier Pujol; Frédéric Mesnard; Henri Sauvageot (IEEE Trans. Geosci. Remote. Sens., 2012)

Eventual linear ranking functions. - Roberto Bagnara; Fred Mesnard (PPDP, 2013)

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)

Termination Competition (termCOMP 2015). - Jürgen Giesl; Frédéric Mesnard; Albert Rubio; René Thiemann; Johannes Waldmann (CADE, 2015)

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)

Pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018). - Fred Mesnard; Peter J. Stuckey (CoRR, 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)

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)