2024

• Fred Mesnard, Thierry Marianne and Étienne Payet. Automated Theorem Proving for Prolog Verification. Logic for Programming, Artificial Intelligence and Reasoning (LPAR-25), 2024. Slides, code.

2023

• Fred Mesnard and Étienne Payet. NTI+cTI: a Logic Programming Termination Analyzer. Proc. of the 19th International Workshop on Termination (WST'23), 2023. Slides.

2020

• Fred Mesnard, Étienne Payet, and Germán Vidal. Selective Unification in (Constraint Logic) Programming. Fundamenta Informaticae, vol. 177, no 3-4, 2020.
• Fred Mesnard, Étienne Payet, and Germán Vidal. Concolic testing in CLP. Theory and Practice of Logic Programming, 20(5):671-686, 2020.
• Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, and Germán Vidal. An SMT-based concolic testing tool for logic programs (poster). Proc. of the 15th International Symposium on Functional and Logic Languages, FLOPS 2020. Nakano and K. Sagonas, Eds. Springer Lecture Notes in Computer Science. Extended version, 2020.

2019

• Fred Mesnard and Peter Stuckey. Post-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR'18, Revised Selected Papers, Lecture Notes in Computer Science 11408, Springer 2019.

2018

• Fred Mesnard and Peter Stuckey. Pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR'18, 2018.

2017

• Fred Mesnard, Étienne Payet, and Germán Vidal. Selective Unification in Constraint Logic Programming (preprint). Principles and Practice of Declarative Programming (PPDP'17), 2017. Slides.
• Fonenantsoa Maurica, Fred Mesnard, and Étienne Payet. Optimal Approximation for Efficient Termination Analysis of Floating-point Loops. Proc. of the 1st IEEE Conference on Next Generation Computing Applications, 2017.

2016

• Fonenantsoa Maurica, Fred Mesnard, and Étienne Payet. Termination analysis of floating-point programs using parameterizable rational approximations. Proc . of the 31st ACM/SIGAPP Symposium on Applied Computing (SAC'16), 2016.
• Fred Mesnard, Étienne Payet and Wim Vanhoof. Towards a Framework for Algorithm Recognition in Binary Code. Principles and Practice of Declarative Programming (PPDP'16), 2016.
• Fonenantsoa Maurica, Fred Mesnard, and Étienne Payet. On the linear ranking problem for simple floating-point loops. Static Analysis Symposium (SAS'16), 2016.
• Fred Mesnard, Étienne Payet, and Germán Vidal. On the Completeness of Selective Unification in Concolic Testing of Logic Programs (video). Proc. of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR'16), 2016.

2015

• Fred Mesnard, Étienne Payet, and Germán Vidal. Concolic Testing in Logic programming. Presented at the 31st International Conference on Logic Programming, 2015. Published in Theory and Practice of Logic Programming. Long version, online tool, and video.
• Fred Mesnard and Étienne Payet. A Second-Order Formulation of Non-Termination. Information Processing Letters, 2015. Preliminary version available as a technical report, 2014.
• Jürgen Giesl, Fred Mesnard, Albert Rubio, René Thiemann, and Johannes Waldmann. Termination Competition (termCOMP 2015), International Conference on Automated Deduction, 2015.

2014

• Étienne Payet and Fred Mesnard Non-termination of Dalvik bytecode via compilation to CLP, International Workshop on Termination, 2014. Slides.

2013

• Roberto Bagnara and Fred Mesnard. Eventual Linear Ranking Functions, Principles and Practice of Declarative Programming, 2013. Slides.
• Anthony Alezan, Roberto Bagnara, Fred Mesnard et Étienne Payet. Détection des fonctions de rang linéaires à terme, Journées Francophones de Programmation par Contraintes, 2013. Slides.

2012

• Roberto Bagnara, Fred Mesnard, Andrea Pescetti, and Enea Zaffanella. A New Look at the Automatic Synthesis of Linear Ranking. Information and Computation, vol. 215, pages 47-67, 2012.
• Étienne Payet, Fred Mesnard, and Fausto Spoto. Non-Termination Analysis of Java Bytecode, technical report, 2012.

2010

• Salvatore Ruggieri and Fred Mesnard. Typing Linear Constraints. ACM Transactions on Programming Languages and Systems, 32(6), 2010.
• Fausto Spoto, Fred Mesnard, and Étienne Payet. A Termination Analyser for Java Bytecode Based on Path-Length. ACM Transactions on Programming Languages and Systems, 32(3), 2010.
• Salvatore Ruggieri and Fred Mesnard. Variable Ranges in Linear Constraints. Proceedings of the 25th ACM Symposium On Applied Computing, 2010. Slides.

2009

• Fausto Spoto, Lunjin Lu, and Fred Mesnard. Using CLP Simplications to Improve Java Bytecode Termination Analysis. Electronic Notes in Theoretical Computer Science, 253(5):129-144, 2009. Slides.
• Étienne Payet and Fred Mesnard. A Non-Termination Criterion for Binary Constraint Logic Programs. Theory and Practice of Logic Programming, 9(2):154-164, 2009.

2008

• Fred Mesnard and Alexander Serebrenik. Recurrence with affine level mappings is P-time decidable for CLP(R). Theory and Practice of Logic Programming, 8(1):111-119, 2008.
• Salvatore Ruggieri and Fred Mesnard. Typing Linear Constraints for Moding CLP(R) Programs. In M. Alpuente and G. Vidal, editors, Proc. of the 14th International Static Analysis Symposium (SAS'08). Pages 128-143. Springer, 2008. LNCS 5079. Slides.

2006

• Étienne Payet and Fred Mesnard. Non-termination inference of logic programs. ACM Transactions on Programming Languages and Systems, 28, Issue 2:256-289, March 2006.

2005

• Étienne Payet and Fred Mesnard. An improved non-termination criterion for binary constraint logic programs. In Susana Muñoz-Hernández and Alexander Serebrenik, editors, Proc. of the 15th International Workshop on Logic Programming Environments (WLPE'05). Pages 46-60, 2005.
• Florence Benoy, Andy King, and Fred Mesnard. Computing convex hulls with a linear solver. Theory and Practice of Logic Programming, 5(1-2):259-271, 2005.
• Fred Mesnard and Roberto Bagnara. cTI: a constraint-based Termination Inference tool for ISO-Prolog. Theory and Practice of Logic Programming, 5(1-2):243-257, 2005.
• Alexander Serebrenik and Fred Mesnard. On termination of binary CLP programs. In Proc. of the 14th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR'04). LNCS 3573, Springer, 2005.

2004

• Étienne Payet and Fred Mesnard. Non-termination inference for constraint logic programs. In Roberto Giacobazzi, editor, Proc. of the 11th International Static Analysis Symposium (SAS'04). Volume 3148 of Lecture Notes in Computer Science, pages 377-392. Springer Verlag, 2004.
• Étienne Payet et Fred Mesnard. Inférence de non-terminaison pour les programmes logiques avec contraintes. In Fred Mesnard, editor, Actes des 13èmes Journées Francophones de Programmation en Logique avec Contraintes (JFPLC'04). Pages 55-72. Hermès, 2004.
• Fred Mesnard, editor. Programmation en logique avec contraintes, JFPLC'04, 21, 22 et 23 Juin 2004, Angers, France. ISBN: 2-7462-0937-3. Hermes, 2004.

2003

• Fred Mesnard and Salvatore Ruggieri. On proving left termination of constraint logic programs. ACM Transactions on Computational Logic, 4(2):207-259, 2003.
• Vitaly Lagoon, Fred Mesnard, and Peter Stuckey. Termination analysis with types is more accurate. In Catuscia Palamidessi, editor, International Conference on Logic Programming, volume 2916 of Lecture Notes in Computer Science, pages 254-268. Springer, 2003.
• Fred Mesnard and Alexander Serebrenik, editors. Proceedings of the 13th International Workshop on Logic Programming Environments, Tata Institute of Fundamental Research, Mumbai, India, December 8, 2003, volume CW371 of Report. Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan 200A, B-3001 Heverlee (Belgium), 2003.

2002

• Fred Mesnard, Étienne Payet and Ulrich Neumerkel. Detecting optimal termination conditions of logic programs. In Manuel Hermenegildo and Germán Puebla, editors, Proc. of the 9th International Static Analysis Symposium (SAS'02). Volume 2477 of Lecture Notes in Computer Science, pages 509-525. Springer Verlag, 2002.
• Fred Mesnard, Étienne Payet and Ulrich Neumerkel. Non-termination inference and optimal termination conditions of logic programs. Actes des 11èmes Journées Francophones de Programmation en Logique et Programmation par Contraintes (JFPLC'02). Hermès, 2002.

2001

• Fred Mesnard, Ulrich Neumerkel et Étienne Payet. cTI: un outil pour l'inférence de conditions optimales de terminaison pour Prolog. Actes des 10èmes Journées Francophones de Programmation en Logique et Programmation par Contraintes (JFPLC'01). Hermès, 2001.
• F. Mesnard and U. Neumerkel. Applying static analysis techniques for inferring termination conditions of logic programs. In P. Cousot, editor, Proc. of the 8th International Static Analysis Symposium (SAS'01), pages 93-110. Springer, 2001. LNCS 2126.

2000

• Serge Burckel, Sébastien Hoarau, Fred Mesnard, and Ulrich Neumerkel. cTI : bottom-up termination inference for logic programs. In Workshop on Logic Programming, 2000. Berlin, Germany.
• Sébastien Hoarau, Fred Mesnard, and Ulrich Neumerkel. Implementing cTI : a constrained-based left-Termination Inference tool for LP. In I. de Costra Dutra, editor, Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, 2000. London, U.K.
• Fred Mesnard and Antoine Rauzy. Le iota-calcul : un langage de contraintes d’ordre supérieur. In Touraivane, editor, Journées Francophones de Programmation Logique avec Contraintes. Hermes, 2000.
• Fred Mesnard and Ulrich Neumerkel. CHR for prototyping abstract interpretation. Journal of Applied Artificial Intelligence, 14(4), 2000. In Selected recent project descriptions involving CHR.

1999

• Ulrich Neumerkel and Fred Mesnard. Localizing and explaining reasons for non- terminating logic programs with failure-slices. In G. Nadathur, editor, Principles and Practice of Declarative Programming, volume 1702 of LNCS, pages 328-341. Springer, 1999.
• Serge Colin, Fred Mesnard, and Antoine Rauzy. Un module Prolog de mu-calcul booléen : une réalisation par BDD. In J-F. Boulicaut, editor, Journées Francophones de Programmation Logique et programmation par Contraintes, pages 23-38. Herms, 1999.

1998

• Fred Mesnard, Sébastien Hoarau, and Alexandra Maillard. CLP(X) for automatically proving program properties. Journal of Logic Programming, pages 77-93, 1998.
• Sébastien Hoarau and Fred Mesnard. Inferring and compiling termination for constraint logic programs. In P. Flener, editor, Logic-Based Program Synthesis and Transformation, volume 1559 of LNCS, pages 240-254. Springer, 1998.
• Sébastien Hoarau and Fred Mesnard. Inférer and compiler la terminaison pour les programmes logiques avec contraintes. In O. Ridoux, editor, Journées Francophones de Programmation Logique et par Contraintes, pages 269-286. Hermes, 1998.

1997

• Serge Colin, Fred Mesnard, and Antoine Rauzy. Constraint logic programming and mu-calculus. ERCIM/COMPULOG Workshop on Constraints, 1997.
• Fred Mesnard. Entailment and Projection for CLP(B) and CLP(Q) in SICStus Prolog. In P. Hill, J. Gallagher, and A. King, editors, Constraint Reasoning For Constraint Programming, 1997. Leeds, U.K.
• Fred Mesnard and Sébastien Hoarau. A tabulation algorithm for CLP. In D.S. Warren et al., editor, Tabling in Logic Programming, pages 13-24, 1997. Leuven, Belgium.

1996

• Fred Mesnard. Inferring left-terminating classes of queries for constraint logic programs. In M. Maher, editor, Joint International Conference and Symposium on Logic Programming, pages 7-21. MIT Press, 1996.
• Fred Mesnard, Sébastien Hoarau, and Alexandra Maillard. CLP(X) for proving program properties. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems, pages 321-338. Kluwer Academic Publishers, 1996.
• Sébastien Hoarau and Fred Mesnard. PLC(Bool) pour la détection de variables numériques bornées. In J-L. Imbert, editor, Journées Francophones de Programmation Logique et programmation par Contraintes, pages 169-183. Hermes, 1996.

1995

• F. Mesnard. Towards automatic control for CLP(X) programs. In M. Proietti, editor, Logic-Based Program Synthesis and Transformation, volume 1048 of LNCS, pages 106-119. Springer, 1995.
• F. Mesnard and S. Hoarau. Contrôle dynamique de la résolution pour les programmes logiques avec contraintes. In J-J. Chabrier, editor, Journées Francophones de Programmation en Logique, pages 259-273, 1995.

1994

• F. Mesnard. Etude de la terminaison des programmes logiques avec contraintes, au moyen d’approximations. In M-M. Corsini, editor, Journées Francophones de Programmation en Logique, pages 205-219, 1994.

1993

• F. Mesnard. Approximations entre langages de programmation logique avec contraintes. In P. Ezequel, editor, Journées Francophones de Programmation en Logique, pages 319-341, 1993.

1992

• F. Mesnard and J-G. Ganascia. CLP(Q) for proving interargument rela- tions. In A. Pettorossi, editor, Meta-Programming in Logic, volume 649 of LNCS, pages 308-320. Springer, 1992.
• F. Mesnard and M. Morillon. Linear measures for controlling CLP(Q). In M. Billaud, P. Casteran, M-M. Corsini, K. Musumbu, and A. Rauzy, editors, Workshop on Static Analysis, number 81-82 in Bigre, pages 29-34, 1992.
• F. Mesnard and J-G. Ganascia. CLP(X)for proving program properties. In J-P. Delahaye, P. Devienne, P. Mathieu, and P. Yim, editors, Journées Francophones de Programmation en Logique, pages 328-338, 1992.

1991

• F. Mesnard and J-G. Ganascia. Contrôler la résolution par sélection des littéraux et déduction partielle. In Reconnaissance de Formes et Intelligence Artificielle, pages 1309-1314, 1991.
• F. Mesnard and J-G. Ganascia. A propos du contrôle de la résolution. In Journées de Travail sur l’Analyse Statique de la Programmation Equationnelle, Fonctionnelle et Logique, number 74 in Bigre, pages 125-131, 1991.