| 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), 1-70, 2010 | 161 | 2010 |
| Static analysis of Android programs É Payet, F Spoto Information and Software Technology 54 (11), 1192-1201, 2012 | 113 | 2012 |
| Path-length analysis for object-oriented programs F Spoto, PM Hill, É Payet First International Workshop on Emerging Applications of Abstract …, 2006 | 50 | 2006 |
| Loop detection in term rewriting using the eliminating unfoldings É Payet Theoretical Computer Science 403 (2-3), 307-327, 2008 | 37 | 2008 |
| Nontermination inference of logic programs É Payet, F Mesnard ACM Transactions on Programming Languages and Systems (TOPLAS) 28 (2), 256-289, 2006 | 36 | 2006 |
| Static analysis of Android programs É Payet, F Spoto International Conference on Automated Deduction, 439-445, 2011 | 31 | 2011 |
| An operational semantics for Android activities E Payet, F Spoto Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and …, 2014 | 29 | 2014 |
| Experiments with non-termination analysis for Java Bytecode É Payet, F Spoto Electronic Notes in Theoretical Computer Science 253 (5), 83-96, 2009 | 25 | 2009 |
| Detecting optimal termination conditions of logic programs F Mesnard, E Payet, U Neumerkel International Static Analysis Symposium, 509-525, 2002 | 19 | 2002 |
| Magic-sets transformation for the analysis of Java bytecode É Payet, F Spoto International Static Analysis Symposium, 452-467, 2007 | 18 | 2007 |
| Synchronized product of linear bounded machines T Knapik, E Payet Fundamentals of Computation Theory: 12th International Symposium, FCT’99 …, 1999 | 17 | 1999 |
| Detecting non-termination of term rewriting systems using an unfolding operator É Payet International Symposium on Logic-Based Program Synthesis and Transformation …, 2006 | 12 | 2006 |
| 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 | 10 | 2009 |
| Thue specifications, infinite graphs and synchronized product E Payet Fundamenta Informaticae 44 (3), 265-290, 2000 | 9 | 2000 |
| 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 | 8 | 2016 |
| Termination analysis of floating-point programs using parameterizable rational approximations F Maurica, F Mesnard, É Payet Proceedings of the 31st Annual ACM Symposium on Applied Computing, 1674-1679, 2016 | 7 | 2016 |
| Non-termination inference for constraint logic programs E Payet, F Mesnard International Static Analysis Symposium, 377-392, 2004 | 7 | 2004 |
| Non-termination analysis of Java bytecode É Payet, F Mesnard, F Spoto arXiv preprint arXiv:1401.5292, 2014 | 6 | 2014 |
| On the linear ranking problem for simple floating-point loops F Maurica, F Mesnard, É Payet Static Analysis: 23rd International Symposium, SAS 2016, Edinburgh, UK …, 2016 | 5 | 2016 |
