Frédéric Mesnard
Frédéric Mesnard
Verified email at univ-reunion.fr - Homepage
Title
Cited by
Cited by
Year
A termination analyzer for Java bytecode based on path-length
F Spoto, F Mesnard, É Payet
ACM Transactions on Programming Languages and Systems (TOPLAS) 32 (3), 8, 2010
1422010
Inferring left-terminating classes of queries for constraint logic programs
F Mesnard
Proceedings of the 1996 Joint International Conference and Syposium on Logic …, 1996
641996
Applying static analysis techniques for inferring termination conditions of logic programs
F Mesnard, U Neumerkel
Static Analysis, 93-110, 2001
542001
On proving left termination of constraint logic programs
F Mesnard, S Ruggieri
ACM Transactions on Computational Logic (TOCL) 4 (2), 207-259, 2003
482003
A new look at the automatic synthesis of linear ranking functions
R Bagnara, F Mesnard, A Pescetti, E Zaffanella
Information and Computation 215, 47-67, 2012
412012
Computing convex hulls with a linear solver
F Benoy, A King, F Mesnard
arXiv preprint cs/0311002, 2003
392003
Nontermination inference of logic programs
E Payet, F Mesnard
ACM Transactions on Programming Languages and Systems (TOPLAS) 28 (2), 256-289, 2006
362006
cTI: A constraint-based termination inference tool for ISO-Prolog
F Mesnard, R Bagnara
Theory and Practice of Logic Programming 5 (1-2), 243-257, 2005
352005
Termination analysis with types is more accurate
V Lagoon, F Mesnard, P Stuckey
Logic Programming, 254-268, 2003
302003
Eventual linear ranking functions
R Bagnara, F Mesnard
Proceedings of the 15th Symposium on Principles and Practice of Declarative …, 2013
252013
Termination competition (termCOMP 2015)
J Giesl, F Mesnard, A Rubio, R Thiemann, J Waldmann
International Conference on Automated Deduction, 105-108, 2015
242015
Recurrence with affine level mappings is p-time decidable for clp
F Mesnard, A Serebrenik
Theory and Practice of Logic Programming 8 (1), 111-119, 2008
242008
Detecting optimal termination conditions of logic programs
F Mesnard, E Payet, U Neumerkel
Static Analysis, 183-200, 2002
152002
Localizing and explaining reasons for non-terminating logic programs with failure-slices
U Neumerkel, F Mesnard
Principles and Practice of Declarative Programming, 328-341, 1999
121999
Inferring and compiling termination for constraint logic programs
S Hoarau, F Mesnard
Logic-based Program Synthesis and Transformation, 240-254, 1999
121999
A non-termination criterion for binary constraint logic programs
É Payet, F Mesnard
arXiv preprint arXiv:0807.3451, 2008
102008
Constraint logic programming and mu-calculus. ERCIM
S Colin, F Mesnard, A Rauzy
COMPULOG Workshop on Constraints, 1997
9*1997
Constraint logic programming and mucalculus
S Colin, F Mesnard, A Rauzy
Proceedings of the ERCIM/COMPULOG Workshop on Constraints. Schloss Hagenberg …, 1997
91997
Towards automatic control for CLP (χ) programs
F Mesnard
Logic Program Synthesis and Transformation, 106-119, 1996
91996
Concolic testing in logic programming
F Mesnard, E Payet, G Vidal
arXiv preprint arXiv:1507.05454, 2015
82015
The system can't perform the operation now. Try again later.
Articles 1–20