Frédéric Mesnard

Publication Activity (10 Years)

Years Active: 1991-2016
Publications (10 Years): 4

Top Topics

Instruction Set

Termination Analysis

Top Venues

IEEE Trans. Geosci. Remote. Sens.

Publications

Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet
Termination analysis of floating-point programs using parameterizable rational approximations. SAC (2016)
Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet
On the Linear Ranking Problem for Simple Floating-Point Loops. SAS (2016)
Frédéric Mesnard, Étienne Payet, Wim Vanhoof
Towards a framework for algorithm recognition in binary code. PPDP (2016)
Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann
Termination Competition (termCOMP 2015). CADE (2015)
Étienne Payet, Frédéric Mesnard
Non-termination of Dalvik bytecode via compilation to CLP. CoRR (2014)
Olivier Pujol, Frédéric Mesnard, Henri Sauvageot
Effects of Melting Layer in Airborne Meteorological X-Band Radar Observations. IEEE Trans. Geosci. Remote. Sens. 50 (6) (2012)
Étienne Payet, Frédéric Mesnard
A non-termination criterion for binary constraint logic programs. Theory Pract. Log. Program. 9 (2) (2009)
Salvatore Ruggieri, Frédéric Mesnard
Typing Linear Constraints for Moding CLP() Programs. SAS (2008)
Étienne Payet, Frédéric Mesnard
A Non-Termination Criterion for Binary Constraint Logic Programs CoRR (2008)
Frédéric Mesnard, Alexander Serebrenik
Recurrence with affine level mappings is P-time decidable for CLP(R). Theory Pract. Log. Program. 8 (1) (2008)
Frédéric Mesnard, Alexander Serebrenik
Recurrence with affine level mappings is P-time decidable for CLP(R) CoRR (2007)
Étienne Payet, Frédéric Mesnard
Nontermination inference of logic programs. ACM Trans. Program. Lang. Syst. 28 (2) (2006)
Étienne Payet, Frédéric Mesnard
An Improved Non-Termination Criterion for Binary Constraint Logic Programs. WLPE (2005)
Étienne Payet, Frédéric Mesnard
An Improved Non-Termination Criterion for Binary Constraint Logic Programs CoRR (2005)
Florence Benoy, Andy King, Frédéric Mesnard
Computing convex hulls with a linear solver. Theory Pract. Log. Program. 5 (1-2) (2005)
Frédéric Mesnard, Roberto Bagnara
cTI: A constraint-based termination inference tool for ISO-Prolog. Theory Pract. Log. Program. 5 (1-2) (2005)
Étienne Payet, Frédéric Mesnard
Inférence de non-terminaison pour les programmes logiques avec contraintes. JFPLC (2004)
Alexander Serebrenik, Frédéric Mesnard
On Termination of Binary CLP Programs. LOPSTR (2004)
Étienne Payet, Frédéric Mesnard
Non-termination Inference for Constraint Logic Programs. SAS (2004)
Étienne Payet, Frédéric Mesnard
Non-Termination Inference of Logic Programs CoRR (2004)
Florence Benoy, Andy King, Frédéric Mesnard
Computing Convex Hulls with a Linear Solver CoRR (2003)
Frédéric Mesnard, Salvatore Ruggieri
On proving left termination of constraint logic programs. ACM Trans. Comput. Log. 4 (2) (2003)
Vitaly Lagoon, Frédéric Mesnard, Peter J. Stuckey
Termination Analysis with Types Is More Accurate. ICLP (2003)
Frédéric Mesnard, Salvatore Ruggieri
On proving left termination of constraint logic programs. ACM Trans. Comput. Log. 4 (2) (2003)
Frédéric Mesnard, Roberto Bagnara
cTI: A constraint-based termination inference tool for ISO-Prolog CoRR (2003)
Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel
Non-Termination Inference for Optimal Termination Conditions of Logic Programs. JFPLC (2002)
Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel
Detecting Optimal Termination Conditions of Logic Programs. SAS (2002)
Étienne Payet, Frédéric Mesnard
A Generalization of the Lifting Lemma for Logic Programming CoRR (2002)
Frédéric Mesnard, Ulrich Neumerkel, Étienne Payet
cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog. JFPLC (2001)
Frédéric Mesnard, Ulrich Neumerkel
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs. SAS (2001)
Stefan Kral, Frédéric Mesnard, Ulrich Neumerkel
Slicing zur Fehlersuche in Logikprogrammen. WLP (2000)
Serge Burckel, Sébastien Hoarau, Frédéric Mesnard, Ulrich Neumerkel
cTI: Bottom-Up Termination Inference for Logic Programs. WLP (2000)
Frédéric Mesnard, Antoine Rauzy
Le iota-calcul: un langage de contraintes d'ordre supérieur. JFPLC (2000)
Serge Colin, Frédéric Mesnard, Antoine Rauzy
Un module Prolog de mu-calcul booléen: une réalisation par BDD. JFPLC (1999)
Ulrich Neumerkel, Frédéric Mesnard
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices. PPDP (1999)
Sébastien Hoarau, Frédéric Mesnard
Inferring and Compiling Termination for Constraint Logic Programs. LOPSTR (1998)
Frédéric Mesnard, Sébastien Hoarau, Alexandra Maillard
CLP(chi) for Automatically Proving Program Properties. J. Log. Program. 37 (1-3) (1998)
Sébastien Hoarau, Frédéric Mesnard
Inférer et compiler la terminaison des programmes logiques avec contraintes. JFPLC (1998)
Sébastien Hoarau, Frédéric Mesnard
PLC(Bool) pour la détection de variables numériques bornées. JFPLC (1996)
Frédéric Mesnard, Sébastien Hoarau, Alexandra Maillard
CLP(chi) for Proving Program Properties. FroCoS (1996)
Frédéric Mesnard
Inferring Left-terminating Classes of Queries for Constraint Logic Programs. JICSLP (1996)
Frédéric Mesnard, Sébastien Hoarau
Contrôle dynamique de la résolution pour les programmes logiques avec contraintes. JFPLC (1995)
Frédéric Mesnard
Towards Automatic Control for CLP(x) Programs. LOPSTR (1995)
Frédéric Mesnard
Étude de la terminaison des programmes logiques avec contraintes au moyen d'approximations. JFPLC (1994)
Frédéric Mesnard
Approximations entre langages de programmation logique avec contraintes. JFPL (1993)
Frédéric Mesnard, Jean-Gabriel Ganascia
CLP(X) for proving prgram properties. JFPL (1992)
Frédéric Mesnard, Jean-Gabriel Ganascia
CLP(Q) for Proving Interargument Relations. META (1992)
Frédéric Mesnard, Marianne Morillon
Automatic Generation of Valid Linear Measures for CLP(Q) Programs. WSA (1992)
Frédéric Mesnard, Jean-Gabriel Ganascia
A propos du contrôle de la résolution. JTASPEFT/WSA (1991)