Fred Mesnard
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j13 |      | 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) |
| j12 | | Olivier Pujol, Frédéric Mesnard, Henri Sauvageot: Effects of Melting Layer in Airborne Meteorological X-Band Radar Observations. IEEE T. Geoscience and Remote Sensing 50(6): 2318-2324 (2012) |
| 2010 | ||
| j11 | | Fausto Spoto, Fred Mesnard, Étienne Payet: A termination analyzer for Java bytecode based on path-length. ACM Trans. Program. Lang. Syst. 32(3) (2010) |
| j10 | | Salvatore Ruggieri, Fred Mesnard: Typing linear constraints. ACM Trans. Program. Lang. Syst. 32(6) (2010) |
| c29 | | |
| 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) |
| 2009 | ||
| j9 | | Fausto Spoto, Lunjin Lu, Fred Mesnard: Using CLP Simplifications to Improve Java Bytecode Termination Analysis. Electr. Notes Theor. Comput. Sci. 253(5): 129-144 (2009) |
| j8 | | Étienne Payet, Frédéric Mesnard: A non-termination criterion for binary constraint logic programs. TPLP 9(2): 145-164 (2009) |
| 2008 | ||
| j7 | | Frédéric Mesnard, Alexander Serebrenik: Recurrence with affine level mappings is P-time decidable for CLP(R). TPLP 8(1): 111-119 (2008) |
| c28 | | Salvatore Ruggieri, Frédéric Mesnard: Typing Linear Constraints for Moding CLP() Programs. SAS 2008: 128-143 |
| 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) |
| 2006 | ||
| j6 | | Étienne Payet, Frédéric Mesnard: Nontermination inference of logic programs. ACM Trans. Program. Lang. Syst. 28(2): 256-289 (2006) |
| 2005 | ||
| j5 | | Frédéric Mesnard, Roberto Bagnara: cTI: A constraint-based termination inference tool for ISO-Prolog. TPLP 5(1-2): 243-257 (2005) |
| j4 | | Florence Benoy, Andy King, Frédéric Mesnard: Computing convex hulls with a linear solver. TPLP 5(1-2): 259-271 (2005) |
| c27 | | Étienne Payet, Frédéric Mesnard: An Improved Non-Termination Criterion for Binary Constraint Logic Programs. WLPE 2005: 46-60 |
| i5 | | Étienne Payet, Frédéric Mesnard: An Improved Non-Termination Criterion for Binary Constraint Logic Programs. CoRR abs/cs/0508106 (2005) |
| 2004 | ||
| c26 |  | Étienne Payet, Frédéric Mesnard: Inférence de non-terminaison pour les programmes logiques avec contraintes. JFPLC 2004 |
| c25 | | |
| c24 | | Étienne Payet, Frédéric Mesnard: Non-termination Inference for Constraint Logic Programs. SAS 2004: 377-392 |
| e2 | | Frédéric Mesnard (Ed.): Programmation en logique avec contraintes, JFPLC 2004, 21, 22 et 23 Juin 2004, Angers, France. Hermes 2004, isbn 2-7462-0937-3 |
| i4 | | Étienne Payet, Frédéric Mesnard: Non-Termination Inference of Logic Programs. CoRR cs.PL/0406041 (2004) |
| 2003 | ||
| j3 | | Frédéric Mesnard, Salvatore Ruggieri: On proving left termination of constraint logic programs. ACM Trans. Comput. Log. 4(2): 1-26 (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) |
| c23 | | Vitaly Lagoon, Frédéric Mesnard, Peter J. Stuckey: Termination Analysis with Types Is More Accurate. ICLP 2003: 254-268 |
| e1 | | Frédéric Mesnard, Alexander Serebrenik (Eds.): 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 |
| 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 | ||
| 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 |
| i1 | | Étienne Payet, Frédéric Mesnard: A Generalization of the Lifting Lemma for Logic Programming. CoRR cs.LO/0212026 (2002) |
| 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. 15. 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 | ||
| 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) |
| 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 | | |
| 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 | | |
| 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 |
Colors in the list of coauthors
Last update Thu May 23 06:20:46 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page