Frédéric Mesnard

According to our database, Frédéric Mesnard authored at least 60 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Automated Theorem Proving for Prolog Verification.

Fred Mesnard, Thierry Marianne, Étienne Payet

Proceedings of the LPAR 2024 Complementary Volume, Port Louis, Mauritius, May 26-31, 2024, 2024

2023

The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions.

Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer, Fred Mesnard, Étienne Payet

CoRR, 2023

2020

Concolic Testing in CLP.

Fred Mesnard, Étienne Payet, Germán Vidal

Theory Pract. Log. Program., 2020

Selective Unification in (Constraint) Logic Programming.

Fred Mesnard, Étienne Payet, Germán Vidal

Fundam. Informaticae, 2020

An SMT-Based Concolic Testing Tool for Logic Programs.

Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal

Proceedings of the Functional and Logic Programming - 15th International Symposium, 2020

2018

Pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018).

Fred Mesnard, Peter J. Stuckey

CoRR, 2018

2016

On the Linear Ranking Problem for Simple Floating-Point Loops.

Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet

Proceedings of the Static Analysis - 23rd International Symposium, 2016

Termination analysis of floating-point programs using parameterizable rational approximations.

Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet

Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

Towards a framework for algorithm recognition in binary code.

Frédéric Mesnard, Étienne Payet, Wim Vanhoof

Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

On the Completeness of Selective Unification in Concolic Testing of Logic Programs.

Fred Mesnard, Étienne Payet, Germán Vidal

Proceedings of the Logic-Based Program Synthesis and Transformation, 2016

2015

Concolic testing in logic programming.

Fred Mesnard, Étienne Payet, Germán Vidal

Theory Pract. Log. Program., 2015

A second-order formulation of non-termination.

Fred Mesnard, Étienne Payet

Inf. Process. Lett., 2015

Termination Competition (termCOMP 2015).

Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Non-Termination Analysis of Java Bytecode.

Étienne Payet, Fred Mesnard, Fausto Spoto

CoRR, 2014

Non-termination of Dalvik bytecode via compilation to CLP.

Étienne Payet, Frédéric Mesnard

CoRR, 2014

2013

Eventual linear ranking functions.

Roberto Bagnara, Fred Mesnard

Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

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

A new look at the automatic synthesis of linear ranking functions.

Roberto Bagnara, Fred Mesnard, Andrea Pescetti, Enea Zaffanella

Inf. Comput., 2012

2010

A termination analyzer for Java bytecode based on path-length.

Fausto Spoto, Fred Mesnard, Étienne Payet

ACM Trans. Program. Lang. Syst., 2010

Typing linear constraints.

Salvatore Ruggieri, Fred Mesnard

ACM Trans. Program. Lang. Syst., 2010

The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version

Roberto Bagnara, Fred Mesnard, Andrea Pescetti, Enea Zaffanella

CoRR, 2010

Variable ranges in linear constraints.

Salvatore Ruggieri, Fred Mesnard

Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

2009

A non-termination criterion for binary constraint logic programs.

Étienne Payet, Frédéric Mesnard

Theory Pract. Log. Program., 2009

Using CLP Simplifications to Improve Java Bytecode Termination Analysis.

Fausto Spoto, Lunjin Lu, Fred Mesnard

Proceedings of the Fourth Workshop on Bytecode Semantics, 2009

2008

Recurrence with affine level mappings is P-time decidable for CLP(R).

Frédéric Mesnard, Alexander Serebrenik

Theory Pract. Log. Program., 2008

Typing Linear Constraints for Moding CLP() Programs.

Salvatore Ruggieri, Frédéric Mesnard

Proceedings of the Static Analysis, 15th International Symposium, 2008

2006

Nontermination inference of logic programs.

Étienne Payet, Frédéric Mesnard

ACM Trans. Program. Lang. Syst., 2006

2005

cTI: A constraint-based termination inference tool for ISO-Prolog.

Frédéric Mesnard, Roberto Bagnara

Theory Pract. Log. Program., 2005

Computing convex hulls with a linear solver.

Florence Benoy, Andy King, Frédéric Mesnard

Theory Pract. Log. Program., 2005

An Improved Non-Termination Criterion for Binary Constraint Logic Programs.

Étienne Payet, Frédéric Mesnard

Proceedings of the 15th International Workshop on Logic Programming Environments, 2005

2004

Non-Termination Inference of Logic Programs

Étienne Payet, Frédéric Mesnard

CoRR, 2004

Non-termination Inference for Constraint Logic Programs.

Étienne Payet, Frédéric Mesnard

Proceedings of the Static Analysis, 11th International Symposium, 2004

On Termination of Binary CLP Programs.

Alexander Serebrenik, Frédéric Mesnard

Proceedings of the Logic Based Program Synthesis and Transformation, 2004

Inférence de non-terminaison pour les programmes logiques avec contraintes.

Étienne Payet, Frédéric Mesnard

Proceedings of the Programmation en logique avec contraintes, 2004

2003

On proving left termination of constraint logic programs.

Frédéric Mesnard, Salvatore Ruggieri

ACM Trans. Comput. Log., 2003

Termination Analysis with Types Is More Accurate.

Vitaly Lagoon, Frédéric Mesnard, Peter J. Stuckey

Proceedings of the Logic Programming, 19th International Conference, 2003

2002

A Generalization of the Lifting Lemma for Logic Programming

Étienne Payet, Frédéric Mesnard

CoRR, 2002

Detecting Optimal Termination Conditions of Logic Programs.

Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel

Proceedings of the Static Analysis, 9th International Symposium, 2002

Non-Termination Inference for Optimal Termination Conditions of Logic Programs.

Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel

Proceedings of the Programmation en logique avec contraintes, 2002

2001

Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs.

Frédéric Mesnard, Ulrich Neumerkel

Proceedings of the Static Analysis, 8th International Symposium, 2001

cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog.

Frédéric Mesnard, Ulrich Neumerkel, Étienne Payet

Proceedings of the Programmation en logique avec contraintes, Actes des JFPLC'2001, 24 avril, 2001

2000

Slicing zur Fehlersuche in Logikprogrammen.

Stefan Kral, Frédéric Mesnard, Ulrich Neumerkel

Proceedings of the 14. Workshop Logische Programmierung, 2000

cTI: Bottom-Up Termination Inference for Logic Programs.

Serge Burckel, Sébastien Hoarau, Frédéric Mesnard, Ulrich Neumerkel

Proceedings of the WLP 2000, 2000

Le iota-calcul: un langage de contraintes d'ordre supérieur.

Frédéric Mesnard, Antoine Rauzy

Proceedings of the Programmation en logique avec contraintes, 2000

1999

Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices.

Ulrich Neumerkel, Frédéric Mesnard

Proceedings of the Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29, 1999

Un module Prolog de mu-calcul booléen: une réalisation par BDD.

Serge Colin, Frédéric Mesnard, Antoine Rauzy

Proceedings of the JFPLC'99, 1999

1998

CLP(chi) for Automatically Proving Program Properties.

Frédéric Mesnard, Sébastien Hoarau, Alexandra Maillard

J. Log. Program., 1998

Inferring and Compiling Termination for Constraint Logic Programs.

Sébastien Hoarau, Frédéric Mesnard

Proceedings of the Logic Programming Synthesis and Transformation, 1998

Inférer et compiler la terminaison des programmes logiques avec contraintes.

Sébastien Hoarau, Frédéric Mesnard

Proceedings of the JFPLC'98, 1998

1996

PLC(Bool) pour la détection de variables numériques bornées.

Sébastien Hoarau, Frédéric Mesnard

Proceedings of the JFPLC'96, 1996

Inferring Left-terminating Classes of Queries for Constraint Logic Programs.

Frédéric Mesnard

Proceedings of the Logic Programming, 1996

CLP(chi) for Proving Program Properties.

Frédéric Mesnard, Sébastien Hoarau, Alexandra Maillard

Proceedings of the Frontiers of Combining Systems, 1996

1995

Towards Automatic Control for CLP(x) Programs.

Frédéric Mesnard

Proceedings of the Logic Programming Synthesis and Transformation, 1995

Contrôle dynamique de la résolution pour les programmes logiques avec contraintes.

Frédéric Mesnard, Sébastien Hoarau

Proceedings of the JFPLC'95, 1995

1994

Étude de la terminaison des programmes logiques avec contraintes au moyen d'approximations.

Frédéric Mesnard

Proceedings of the JFPLC'94, 1994

1993

Approximations entre langages de programmation logique avec contraintes.

Frédéric Mesnard

Proceedings of the 2èmes Journées Francophones de Programmation Logique (JFPL 93), 1993

1992

Automatic Generation of Valid Linear Measures for CLP(Q) Programs.

Frédéric Mesnard, Marianne Morillon

Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

CLP(Q) for Proving Interargument Relations.

Frédéric Mesnard, Jean-Gabriel Ganascia

Proceedings of the Meta-Programming in Logic, 3rd International Workshop, 1992

CLP(X) for proving prgram properties.

Frédéric Mesnard, Jean-Gabriel Ganascia

Proceedings of the JFPL'92, 1992

1991

A propos du contrôle de la résolution.

Frédéric Mesnard, Jean-Gabriel Ganascia

Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991