Frédéric Mesnard

50 papers A 1B 6C 5Misc 1Journal 16Unranked 19

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