| 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 | 163 | 2010 |
| Inferring left-terminating classes of queries for constraint logic programs F Mesnard Proceedings of the 1996 Joint International Conference and Syposium on Logic …, 1996 | 64 | 1996 |
| Applying static analysis techniques for inferring termination conditions of logic programs F Mesnard, U Neumerkel Static Analysis, 93-110, 2001 | 56 | 2001 |
| On proving left termination of constraint logic programs F Mesnard, S Ruggieri ACM Transactions on Computational Logic (TOCL) 4 (2), 207-259, 2003 | 52 | 2003 |
| 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 | 51 | 2012 |
| Computing convex hulls with a linear solver F Benoy, A King, F Mesnard Theory and Practice of Logic Programming 5 (1-2), 259-271, 2005 | 41 | 2005 |
| Nontermination inference of logic programs E Payet, F Mesnard ACM Transactions on Programming Languages and Systems (TOPLAS) 28 (2), 256-289, 2006 | 37 | 2006 |
| 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 | 35 | 2005 |
| Termination competition (termCOMP 2015) J Giesl, F Mesnard, A Rubio, R Thiemann, J Waldmann International Conference on Automated Deduction, 105-108, 2015 | 34 | 2015 |
| Eventual linear ranking functions R Bagnara, F Mesnard Proceedings of the 15th Symposium on Principles and Practice of Declarative …, 2013 | 33 | 2013 |
| Termination analysis with types is more accurate V Lagoon, F Mesnard, P Stuckey Logic Programming, 254-268, 2003 | 30 | 2003 |
| 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 | 26 | 2008 |
| Detecting optimal termination conditions of logic programs F Mesnard, E Payet, U Neumerkel Static Analysis, 183-200, 2002 | 19 | 2002 |
| Inferring and compiling termination for constraint logic programs S Hoarau, F Mesnard Logic-based Program Synthesis and Transformation, 240-254, 1999 | 15 | 1999 |
| 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 | 14 | 1999 |
| Concolic testing in logic programming F Mesnard, E Payet, G Vidal Theory and Practice of Logic Programming 15 (4-5), 711-725, 2015 | 11 | 2015 |
| A non-termination criterion for binary constraint logic programs É Payet, F Mesnard Theory and Practice of Logic Programming 9 (2), 145-164, 2009 | 11 | 2009 |
| Towards automatic control for CLP (χ) programs F Mesnard Logic Program Synthesis and Transformation, 106-119, 1996 | 10 | 1996 |
| Towards a framework for algorithm recognition in binary code F Mesnard, É Payet, W Vanhoof Proceedings of the 18th International Symposium on Principles and Practice …, 2016 | 9 | 2016 |
| Hasta-La-Vista: Termination analyser for logic programs A Serebrenik, D De Schreye Extended abstracts of the Sixth international workshop on termination …, 2003 | 9 | 2003 |
Étienne PayetUniversité de La RéunionVerified email at univ-reunion.fr
