| Introducing global constraints in CHIP N Beldiceanu, E Contejean Mathematical and computer Modelling 20 (12), 97-123, 1994 | 523 | 1994 |
| An efficient incremental algorithm for solving systems of linear Diophantine equations É Contejean, H Devie Information and Computation 113, 143-172, 1994 | 193 | 1994 |
| Mechanically proving termination using polynomial interpretations E Contejean, C Marché, AP Tomás, X Urbain Journal of Automated Reasoning 34 (4), 325-363, 2005 | 120 | 2005 |
| The Alt-Ergo automated theorem prover, 2008 F Bobot, S Conchon, É Contejean, M Iguernelala, S Lescuyer, A Mebsout URL http://alt-ergo. lri. fr, 0 | 113* | |
| A new AC unification algorithm with an algorithm for solving systems of Diophantine equations A Boudet, E Contejean, H Devie [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science …, 1990 | 86 | 1990 |
| CiME E Contejean, C Marché, B Monate, X Urbain | 81* | 2000 |
| Certification of automated termination proofs E Contejean, P Courtieu, J Forest, O Pons, X Urbain Frontiers of Combining Systems: 6th International Symposium, FroCoS 2007 …, 2007 | 75 | 2007 |
| Implementing polymorphism in SMT solvers F Bobot, S Conchon, E Contejean, S Lescuyer Proceedings of the Joint Workshops of the 6th International Workshop on …, 2008 | 73 | 2008 |
| Avoiding slack variables in the solving of linear diophantine equations and inequations F Ajili, E Contejean Theoretical Computer Science 173 (1), 183-208, 1997 | 65 | 1997 |
| CC (X): Semantic combination of congruence closure with solvable theories S Conchon, E Contejean, J Kanig, S Lescuyer Electronic Notes in Theoretical Computer Science 198 (2), 51-69, 2008 | 62 | 2008 |
| CiME: Completion Modulo E E Contejean, C Marché Rewriting Techniques and Applications, 416-419, 1996 | 62* | 1996 |
| Automated certified proofs with CiME3 E Contejean, P Courtieu, J Forest, O Pons, X Urbain RTA 22, 21-30, 2011 | 55 | 2011 |
| Proving termination of rewriting with CiME E Contejean, C Marché, B Monate, X Urbain Extended Abstracts of the 6th International Workshop on Termination, WST’03 …, 2003 | 54 | 2003 |
| A certified AC matching algorithm E Contejean Rewriting Techniques and Applications: 15th International Conference, RTA …, 2004 | 51 | 2004 |
| A3PAT, an approach for certified automated termination proofs É Contejean, A Paskevich, X Urbain, P Courtieu, O Pons, J Forest Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and …, 2010 | 48 | 2010 |
| A Coq formalization of the relational data model V Benzaken, É Contejean, S Dumbrava Programming Languages and Systems: 23rd European Symposium on Programming …, 2014 | 41 | 2014 |
| The Ergo automatic theorem prover S Conchon, E Contejean, J Kanig Software and documentation available at http://ergo. lri. fr/(2005–2008), 0 | 38* | |
| A Coq mechanised formal semantics for realistic SQL queries: formally reconciling SQL and bag relational algebra V Benzaken, E Contejean Proceedings of the 8th ACM SIGPLAN International Conference on Certified …, 2019 | 36 | 2019 |
| Complete solving of linear diophantine equations and inequations without adding variables F Ajili, E Contejean Principles and Practice of Constraint Programming—CP'95, 1-17, 1995 | 36* | 1995 |
| Rewrite systems for natural, integral, and rational arithmetic E Contejean, C Marché, L Rabehasaina Rewriting techniques and applications, 98-112, 1997 | 35 | 1997 |
Xavier UrbainFull Professor of Computer Science, University Claude Bernard Lyon 1Verified email at liris.cnrs.fr
