Context-sensitive computations in functional and functional logic programs S Lucas Journal of Functional and Logic Programming 1 (1998), 1-61, 1998 | 190 | 1998 |
Context-sensitive rewriting strategies S Lucas Information and Computation 178 (1), 294-343, 2002 | 128 | 2002 |
Operational termination of conditional term rewriting systems S Lucas, C Marché, J Meseguer Information Processing Letters 95 (4), 446-453, 2005 | 111 | 2005 |
Proving operational termination of membership equational programs F Durán, S Lucas, C Marché, J Meseguer, X Urbain Higher-Order and Symbolic Computation 21 (1), 59-88, 2008 | 99 | 2008 |
Polynomials over the reals in proofs of termination: from theory to practice S Lucas RAIRO-Theoretical Informatics and Applications 39 (3), 547-586, 2005 | 90 | 2005 |
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting S Lucas International Conference on Rewriting Techniques and Applications, 200-209, 2004 | 72 | 2004 |
MTT: The Maude termination tool (system description) F Durán, S Lucas, J Meseguer International Joint Conference on Automated Reasoning, 313-319, 2008 | 69 | 2008 |
The Maude formal tool environment M Clavel, F Durán, J Hendrix, S Lucas, J Meseguer, P Ölveczky Algebra and Coalgebra in Computer Science: Second International Conference …, 2007 | 68 | 2007 |
Termination of on-demand rewriting and termination of OBJ programs S Lucas Proceedings of the 3rd ACM SIGPLAN international conference on Principles …, 2001 | 67 | 2001 |
Proving termination of membership equational programs F Durán, S Lucas, J Meseguer, C Marché, X Urbain Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and …, 2004 | 64 | 2004 |
Termination of rewriting with strategy annotations S Lucas International Conference on Logic for Programming Artificial Intelligence …, 2001 | 63 | 2001 |
SAT modulo linear arithmetic for solving polynomial constraints C Borralleras, S Lucas, A Oliveras, E Rodríguez-Carbonell, A Rubio Journal of Automated Reasoning 48 (1), 107-131, 2012 | 62 | 2012 |
Context-sensitive dependency pairs B Alarcón, R Gutiérrez, S Lucas Information and Computation 208 (8), 922-968, 2010 | 58 | 2010 |
Termination modulo combinations of equational theories F Durán, S Lucas, J Meseguer Frontiers of Combining Systems: 7th International Symposium, FroCoS 2009 …, 2009 | 55 | 2009 |
Termination of context-sensitive rewriting by rewriting S Lucas Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 …, 1996 | 55 | 1996 |
Solving non-linear polynomial arithmetic via SAT modulo linear arithmetic C Borralleras, S Lucas, R Navarro-Marset, E Rodríguez-Carbonell, ... International Conference on Automated Deduction, 294-305, 2009 | 52 | 2009 |
Proving Termination Properties with mu-term B Alarcón, R Gutiérrez, S Lucas, R Navarro-Marset International Conference on Algebraic Methodology and Software Technology …, 2010 | 45 | 2010 |
Strongly sequential and inductively sequential term rewriting systems M Hanus, S Lucas, A Middeldorp Information Processing Letters 67 (1), 1-8, 1998 | 45 | 1998 |
Abstract diagnosis of functional programs M Alpuente, M Comini, S Escobar, M Falaschi, S Lucas International Workshop on Logic-Based Program Synthesis and Transformation, 1-16, 2002 | 42 | 2002 |
Normal forms and normal theories in conditional rewriting S Lucas, J Meseguer Journal of Logical and Algebraic Methods in Programming 85 (1), 67-97, 2016 | 41 | 2016 |