Παρακολούθηση
Salvador Lucas
Salvador Lucas
DSIC & VRAIN, Universitat Politècnica de València
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα dsic.upv.es - Αρχική σελίδα
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
Context-sensitive computations in functional and functional logic programs
S Lucas
Journal of Functional and Logic Programming 1 (1998), 1-61, 1998
1981998
Context-sensitive rewriting strategies
S Lucas
Information and Computation 178 (1), 294-343, 2002
1322002
Operational termination of conditional term rewriting systems
S Lucas, C Marché, J Meseguer
Information Processing Letters 95 (4), 446-453, 2005
1062005
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-2), 59-88, 2008
992008
Polynomials over the reals in proofs of termination: from theory to practice
S Lucas
RAIRO-Theoretical Informatics and Applications 39 (3), 547-586, 2005
922005
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
S Lucas
Rewriting Techniques and Applications: 15th International Conference, RTA …, 2004
722004
MTT: The Maude termination tool (system description)
F Durán, S Lucas, J Meseguer
Automated Reasoning: 4th International Joint Conference, IJCAR 2008 Sydney …, 2008
692008
Termination of on-demand rewriting and termination of OBJ programs
S Lucas
Proceedings of the 3rd ACM SIGPLAN international conference on Principles …, 2001
692001
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
662007
Termination of rewriting with strategy annotations
S Lucas
Logic for Programming, Artificial Intelligence, and Reasoning: 8th …, 2001
652001
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
642004
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
602012
Termination of context-sensitive rewriting by rewriting
S Lucas
Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 …, 1996
571996
Solving non-linear polynomial arithmetic via SAT modulo linear arithmetic
C Borralleras, S Lucas, R Navarro-Marset, E Rodríguez-Carbonell, ...
Automated Deduction–CADE-22: 22nd International Conference on Automated …, 2009
532009
Termination modulo combinations of equational theories
F Durán, S Lucas, J Meseguer
Frontiers of Combining Systems: 7th International Symposium, FroCoS 2009 …, 2009
522009
Context-sensitive dependency pairs
B Alarcón, R Gutiérrez, S Lucas
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006
442006
Proving Termination Properties with mu-term
B Alarcón, R Gutiérrez, S Lucas, R Navarro-Marset
Algebraic Methodology and Software Technology: 13th International Conference …, 2011
432011
Strongly sequential and inductively sequential term rewriting systems
M Hanus, S Lucas, A Middeldorp
Information Processing Letters 67 (1), 1-8, 1998
431998
Abstract diagnosis of functional programs
M Alpuente, M Comini, S Escobar, M Falaschi, S Lucas
Logic Based Program Synthesis and Transformation: 12th International …, 2003
412003
Recursive path orderings can be context-sensitive
C Borralleras, S Lucas, A Rubio
CADE 2, 314-331, 2002
392002
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20