Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrédéric Mesnard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j15]Fred Mesnard, Étienne Payet, Germán Vidal
:
Selective Unification in (Constraint) Logic Programming. Fundam. Informaticae 177(3-4): 359-383 (2020)- [j14]Fred Mesnard, Étienne Payet, Germán Vidal:
Concolic Testing in CLP. Theory Pract. Log. Program. 20(5): 671-686 (2020) - 2015
- [j13]Fred Mesnard, Étienne Payet:
A second-order formulation of non-termination. Inf. Process. Lett. 115(11): 882-885 (2015) - [j12]Fred Mesnard, Étienne Payet, Germán Vidal:
Concolic testing in logic programming. Theory Pract. Log. Program. 15(4-5): 711-725 (2015) - 2012
- [j11]Roberto Bagnara, Fred Mesnard, Andrea Pescetti, Enea Zaffanella:
A new look at the automatic synthesis of linear ranking functions. Inf. Comput. 215: 47-67 (2012) - [j10]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): 2318-2324 (2012) - 2010
- [j9]Fausto Spoto, Fred Mesnard, Étienne Payet:
A termination analyzer for Java bytecode based on path-length. ACM Trans. Program. Lang. Syst. 32(3): 8:1-8:70 (2010) - [j8]Salvatore Ruggieri, Fred Mesnard:
Typing linear constraints. ACM Trans. Program. Lang. Syst. 32(6): 21:1-21:42 (2010) - 2009
- [j7]Étienne Payet, Frédéric Mesnard:
A non-termination criterion for binary constraint logic programs. Theory Pract. Log. Program. 9(2): 145-164 (2009) - 2008
- [j6]Frédéric Mesnard, Alexander Serebrenik:
Recurrence with affine level mappings is P-time decidable for CLP(R). Theory Pract. Log. Program. 8(1): 111-119 (2008) - 2006
- [j5]Étienne Payet, Frédéric Mesnard:
Nontermination inference of logic programs. ACM Trans. Program. Lang. Syst. 28(2): 256-289 (2006) - 2005
- [j4]Frédéric Mesnard, Roberto Bagnara:
cTI: A constraint-based termination inference tool for ISO-Prolog. Theory Pract. Log. Program. 5(1-2): 243-257 (2005) - [j3]Florence Benoy, Andy King, Frédéric Mesnard:
Computing convex hulls with a linear solver. Theory Pract. Log. Program. 5(1-2): 259-271 (2005) - 2003
- [j2]Frédéric Mesnard, Salvatore Ruggieri:
On proving left termination of constraint logic programs. ACM Trans. Comput. Log. 4(2): 207-259 (2003) - 1998
- [j1]Frédéric Mesnard, Sébastien Hoarau, Alexandra Maillard:
CLP(chi) for Automatically Proving Program Properties. J. Log. Program. 37(1-3): 77-93 (1998)
Conference and Workshop Papers
- 2020
- [c39]Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal:
An SMT-Based Concolic Testing Tool for Logic Programs. FLOPS 2020: 215-219 - 2017
- [c38]Fred Mesnard, Étienne Payet, Germán Vidal:
Selective unification in constraint logic programming. PPDP 2017: 115-126 - 2016
- [c37]Fred Mesnard, Étienne Payet, Germán Vidal:
On the Completeness of Selective Unification in Concolic Testing of Logic Programs. LOPSTR 2016: 205-221 - [c36]Frédéric Mesnard, Étienne Payet, Wim Vanhoof:
Towards a framework for algorithm recognition in binary code. PPDP 2016: 202-213 - [c35]Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet:
Termination analysis of floating-point programs using parameterizable rational approximations. SAC 2016: 1674-1679 - [c34]Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet:
On the Linear Ranking Problem for Simple Floating-Point Loops. SAS 2016: 300-316 - 2015
- [c33]Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann:
Termination Competition (termCOMP 2015). CADE 2015: 105-108 - 2013
- [c32]Roberto Bagnara, Fred Mesnard:
Eventual linear ranking functions. PPDP 2013: 229-238 - 2010
- [c31]Salvatore Ruggieri, Fred Mesnard:
Variable ranges in linear constraints. SAC 2010: 2061-2065 - 2009
- [c30]Fausto Spoto, Lunjin Lu, Fred Mesnard:
Using CLP Simplifications to Improve Java Bytecode Termination Analysis. BYTECODE@ETAPS 2009: 129-144 - 2008
- [c29]Salvatore Ruggieri, Frédéric Mesnard:
Typing Linear Constraints for Moding CLP() Programs. SAS 2008: 128-143 - 2005
- [c28]Étienne Payet, Frédéric Mesnard:
An Improved Non-Termination Criterion for Binary Constraint Logic Programs. WLPE 2005: 46-60 - 2004
- [c27]Étienne Payet, Frédéric Mesnard:
Inférence de non-terminaison pour les programmes logiques avec contraintes. JFPLC 2004 - [c26]Alexander Serebrenik, Frédéric Mesnard:
On Termination of Binary CLP Programs. LOPSTR 2004: 231-244 - [c25]Alexander Serebrenik, Fred Mesnard:
On termination of binary CLP programs. WLPE 2004 - [c24]Étienne Payet, Frédéric Mesnard:
Non-termination Inference for Constraint Logic Programs. SAS 2004: 377-392 - 2003
- [c23]Vitaly Lagoon, Frédéric Mesnard, Peter J. Stuckey:
Termination Analysis with Types Is More Accurate. ICLP 2003: 254-268 - 2002
- [c22]Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel:
Non-Termination Inference for Optimal Termination Conditions of Logic Programs. JFPLC 2002: 87- - [c21]Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel:
Detecting Optimal Termination Conditions of Logic Programs. SAS 2002: 509-526 - 2001
- [c20]Frédéric Mesnard, Ulrich Neumerkel, Étienne Payet:
cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog. JFPLC 2001: 271-286 - [c19]Frédéric Mesnard, Ulrich Neumerkel:
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs. SAS 2001: 93-110 - 2000
- [c18]Frédéric Mesnard, Antoine Rauzy:
Le iota-calcul: un langage de contraintes d'ordre supérieur. JFPLC 2000: 241- - [c17]Serge Burckel, Sébastien Hoarau, Frédéric Mesnard, Ulrich Neumerkel:
cTI: Bottom-Up Termination Inference for Logic Programs. WLP 2000: 123-134 - [c16]Stefan Kral, Frédéric Mesnard, Ulrich Neumerkel:
Slicing zur Fehlersuche in Logikprogrammen. WLP 2000: 241-243 - 1999
- [c15]Serge Colin, Frédéric Mesnard, Antoine Rauzy:
Un module Prolog de mu-calcul booléen: une réalisation par BDD. JFPLC 1999: 23-38 - [c14]Ulrich Neumerkel, Frédéric Mesnard:
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices. PPDP 1999: 328-342 - 1998
- [c13]Sébastien Hoarau, Frédéric Mesnard:
Inférer et compiler la terminaison des programmes logiques avec contraintes. JFPLC 1998: 269-286 - [c12]Sébastien Hoarau, Frédéric Mesnard:
Inferring and Compiling Termination for Constraint Logic Programs. LOPSTR 1998: 240-254 - 1996
- [c11]Frédéric Mesnard, Sébastien Hoarau, Alexandra Maillard:
CLP(chi) for Proving Program Properties. FroCoS 1996: 321-338 - [c10]Frédéric Mesnard:
Inferring Left-terminating Classes of Queries for Constraint Logic Programs. JICSLP 1996: 7-21 - [c9]Sébastien Hoarau, Frédéric Mesnard:
PLC(Bool) pour la détection de variables numériques bornées. JFPLC 1996: 169-184 - 1995
- [c8]Frédéric Mesnard, Sébastien Hoarau:
Contrôle dynamique de la résolution pour les programmes logiques avec contraintes. JFPLC 1995: 259-273 - [c7]Frédéric Mesnard:
Towards Automatic Control for CLP(x) Programs. LOPSTR 1995: 106-119 - 1994
- [c6]Frédéric Mesnard:
Étude de la terminaison des programmes logiques avec contraintes au moyen d'approximations. JFPLC 1994: 205- - 1993
- [c5]Frédéric Mesnard:
Approximations entre langages de programmation logique avec contraintes. JFPL 1993: 319-341 - 1992
- [c4]Frédéric Mesnard, Jean-Gabriel Ganascia:
CLP(X) for proving prgram properties. JFPL 1992: 328- - [c3]Frédéric Mesnard, Jean-Gabriel Ganascia:
CLP(Q) for Proving Interargument Relations. META 1992: 308-320 - [c2]Frédéric Mesnard, Marianne Morillon:
Automatic Generation of Valid Linear Measures for CLP(Q) Programs. WSA 1992: 29-34 - 1991
- [c1]Frédéric Mesnard, Jean-Gabriel Ganascia:
A propos du contrôle de la résolution. JTASPEFT/WSA 1991: 125-131
Editorship
- 2019
- [e3]Fred Mesnard, Peter J. Stuckey:
Logic-Based Program Synthesis and Transformation - 28th International Symposium, LOPSTR 2018, Frankfurt/Main, Germany, September 4-6, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11408, Springer 2019, ISBN 978-3-030-13837-0 [contents] - 2004
- [e2]Frédéric Mesnard:
Programmation en logique avec contraintes, JFPLC 2004, 21, 22 et 23 Juin 2004, Angers, France. Hermes 2004, ISBN 2-7462-0937-3 [contents] - 2003
- [e1]Frédéric Mesnard, Alexander Serebrenik:
Proceedings of the 13th International Workshop on Logic Programming Environments, Tata Institute of Fundamental Research, Mumbai, India, December 8, 2003. Report CW371, Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan 200A, B-3001 Heverlee (Belgium) 2003 [contents]
Informal and Other Publications
- 2023
- [i18]Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer, Fred Mesnard, Étienne Payet:
The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions. CoRR abs/2308.09536 (2023) - 2020
- [i17]Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal:
An SMT-Based Concolic Testing Tool for Logic Programs. CoRR abs/2002.07115 (2020) - [i16]Fred Mesnard, Étienne Payet, Germán Vidal:
Concolic Testing in CLP. CoRR abs/2008.00421 (2020) - 2018
- [i15]Fred Mesnard, Peter J. Stuckey:
Pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018). CoRR abs/1808.03326 (2018) - 2016
- [i14]Fred Mesnard, Étienne Payet, Germán Vidal:
On the Completeness of Selective Unification in Concolic Testing of Logic Programs. CoRR abs/1608.03054 (2016) - 2015
- [i13]Fred Mesnard, Étienne Payet, Germán Vidal:
Concolic Testing in Logic Programming. CoRR abs/1507.05454 (2015) - 2014
- [i12]Étienne Payet, Fred Mesnard, Fausto Spoto:
Non-Termination Analysis of Java Bytecode. CoRR abs/1401.5292 (2014) - [i11]Fred Mesnard, Étienne Payet:
A Second-Order Formulation of Non-Termination. CoRR abs/1412.3271 (2014) - [i10]Étienne Payet, Frédéric Mesnard:
Non-termination of Dalvik bytecode via compilation to CLP. CoRR abs/1412.3729 (2014) - 2013
- [i9]Roberto Bagnara, Fred Mesnard:
Eventual Linear Ranking Functions. CoRR abs/1306.1901 (2013) - 2010
- [i8]Roberto Bagnara, Fred Mesnard, Andrea Pescetti, Enea Zaffanella:
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version. CoRR abs/1004.0944 (2010) - 2008
- [i7]Étienne Payet, Frédéric Mesnard:
A Non-Termination Criterion for Binary Constraint Logic Programs. CoRR abs/0807.3451 (2008) - 2007
- [i6]Frédéric Mesnard, Alexander Serebrenik:
Recurrence with affine level mappings is P-time decidable for CLP(R). CoRR abs/cs/0701082 (2007) - 2005
- [i5]Étienne Payet, Frédéric Mesnard:
An Improved Non-Termination Criterion for Binary Constraint Logic Programs. CoRR abs/cs/0508106 (2005) - 2004
- [i4]Étienne Payet, Frédéric Mesnard:
Non-Termination Inference of Logic Programs. CoRR cs.PL/0406041 (2004) - 2003
- [i3]Frédéric Mesnard, Roberto Bagnara:
cTI: A constraint-based termination inference tool for ISO-Prolog. CoRR cs.PL/0309028 (2003) - [i2]Florence Benoy, Andy King, Frédéric Mesnard:
Computing Convex Hulls with a Linear Solver. CoRR cs.PL/0311002 (2003) - 2002
- [i1]Étienne Payet, Frédéric Mesnard:
A Generalization of the Lifting Lemma for Logic Programming. CoRR cs.LO/0212026 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
