| 2008 |
|---|
| 79 | EE | Carsten Fuhs,
Rafael Navarro-Marset,
Carsten Otto,
Jürgen Giesl,
Salvador Lucas,
Peter Schneider-Kamp:
Search Techniques for Rational Polynomial Orders.
AISC/MKM/Calculemus 2008: 109-124 |
| 78 | EE | Francisco Durán,
Salvador Lucas,
José Meseguer:
MTT: The Maude Termination Tool (System Description).
IJCAR 2008: 313-319 |
| 77 | EE | Beatriz Alarcón,
Fabian Emmes,
Carsten Fuhs,
Jürgen Giesl,
Raúl Gutiérrez,
Salvador Lucas,
Peter Schneider-Kamp,
René Thiemann:
Improving Context-Sensitive Dependency Pairs.
LPAR 2008: 636-651 |
| 76 | EE | Salvador Lucas,
José Meseguer:
Order-sorted dependency pairs.
PPDP 2008: 108-119 |
| 75 | EE | Raúl Gutiérrez,
Salvador Lucas,
Xavier Urbain:
Usable Rules for Context-Sensitive Rewrite Systems.
RTA 2008: 126-141 |
| 74 | EE | Sonia Flores,
Salvador Lucas,
Alicia Villanueva:
Formal Verification of Websites.
Electr. Notes Theor. Comput. Sci. 200(3): 103-118 (2008) |
| 73 | EE | Salvador Lucas,
Rafael Navarro-Marset:
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers.
Electr. Notes Theor. Comput. Sci. 206: 75-90 (2008) |
| 72 | EE | Francisco Durán,
Salvador Lucas,
Claude Marché,
José Meseguer,
Xavier Urbain:
Proving operational termination of membership equational programs.
Higher-Order and Symbolic Computation 21(1-2): 59-88 (2008) |
| 71 | EE | Salvador Lucas,
José Meseguer:
Termination of just/fair computations in term rewriting.
Inf. Comput. 206(5): 652-675 (2008) |
| 2007 |
|---|
| 70 | EE | Manuel Clavel,
Francisco Durán,
Joe Hendrix,
Salvador Lucas,
José Meseguer,
Peter Csaba Ölveczky:
The Maude Formal Tool Environment.
CALCO 2007: 173-178 |
| 69 | EE | Beatriz Alarcón,
Salvador Lucas:
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs.
FroCos 2007: 73-87 |
| 68 | EE | Salvador Lucas:
Practical use of polynomials over the reals in proofs of termination.
PPDP 2007: 39-50 |
| 67 | EE | Beatriz Alarcón,
Raúl Gutiérrez,
José Iborra,
Salvador Lucas:
Proving Termination of Context-Sensitive Rewriting with MU-TERM.
Electr. Notes Theor. Comput. Sci. 188: 105-115 (2007) |
| 66 | EE | Beatriz Alarcón,
Raúl Gutiérrez,
Salvador Lucas:
Improving the Context-sensitive Dependency Graph.
Electr. Notes Theor. Comput. Sci. 188: 91-103 (2007) |
| 65 | EE | María Alpuente,
Santiago Escobar,
Salvador Lucas:
Removing redundant arguments automatically.
TPLP 7(1-2): 3-35 (2007) |
| 2006 |
|---|
| 64 | EE | Beatriz Alarcón,
Raúl Gutiérrez,
Salvador Lucas:
Context-Sensitive Dependency Pairs.
FSTTCS 2006: 297-308 |
| 63 | EE | Bernhard Gramlich,
Salvador Lucas:
Generalizing Newman's Lemma for Left-Linear Rewrite Systems.
RTA 2006: 66-80 |
| 62 | EE | Salvador Lucas:
On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting.
Appl. Algebra Eng. Commun. Comput. 17(1): 49-73 (2006) |
| 61 | EE | María Alpuente,
Santiago Escobar,
Salvador Lucas:
Removing Redundant Arguments Automatically
CoRR abs/cs/0601039: (2006) |
| 60 | EE | Salvador Lucas:
Rewriting-Based Navigation of Web Sites: Looking for Models and Logics.
Electr. Notes Theor. Comput. Sci. 157(2): 79-85 (2006) |
| 59 | EE | Salvador Lucas:
Proving termination of context-sensitive rewriting by transformation.
Inf. Comput. 204(12): 1782-1846 (2006) |
| 2005 |
|---|
| 58 | EE | Salvador Lucas,
José Meseguer:
Termination of Fair Computations in Term Rewriting.
LPAR 2005: 184-198 |
| 57 | | Salvador Lucas:
Rewriting-based navigation of Web sites.
WWV 2005: 157-160 |
| 56 | EE | Francisco Durán,
Santiago Escobar,
Salvador Lucas:
New Evaluation Commands for Maude Within Full Maude.
Electr. Notes Theor. Comput. Sci. 117: 263-284 (2005) |
| 55 | EE | Francisco Durán,
Santiago Escobar,
Salvador Lucas:
On-demand Evaluation for Maude.
Electr. Notes Theor. Comput. Sci. 124(1): 25-39 (2005) |
| 54 | EE | Salvador Lucas:
Strategies in Programming Languages Today.
Electr. Notes Theor. Comput. Sci. 124(2): 113-118 (2005) |
| 53 | EE | Salvador Lucas:
Preface.
Electr. Notes Theor. Comput. Sci. 137(1): 1-3 (2005) |
| 52 | EE | Salvador Lucas,
Claude Marché,
José Meseguer:
Operational termination of conditional term rewriting systems.
Inf. Process. Lett. 95(4): 446-453 (2005) |
| 51 | EE | Bernhard Gramlich,
Salvador Lucas:
Reduction strategies in rewriting and programming.
J. Symb. Comput. 40(1): 745-747 (2005) |
| 50 | EE | María Alpuente,
Salvador Lucas,
Michael Hanus,
Germán Vidal:
Specialization of functional logic programs based on needed narrowing.
TPLP 5(3): 273-303 (2005) |
| 2004 |
|---|
| 49 | EE | Salvador Lucas:
Polynomials for Proving Termination of Context-Sensitive Rewriting.
FoSSaCS 2004: 318-332 |
| 48 | EE | Francisco Durán,
Salvador Lucas,
José Meseguer,
Claude Marché,
Xavier Urbain:
Proving termination of membership equational programs.
PEPM 2004: 147-158 |
| 47 | EE | Salvador Lucas:
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.
RTA 2004: 200-209 |
| 46 | EE | María Alpuente,
Michael Hanus,
Salvador Lucas,
Germán Vidal:
Specialization of Functional Logic Programs Based on Needed Narrowing
CoRR cs.PL/0403011: (2004) |
| 45 | EE | Salvador Lucas:
Strong and NV-sequentiality of constructor systems.
Inf. Process. Lett. 89(4): 191-201 (2004) |
| 2003 |
|---|
| 44 | | María Alpuente,
Demis Ballis,
Santiago Escobar,
Moreno Falaschi,
Salvador Lucas:
Abstract Correction of OBJ-like Programs.
APPIA-GULP-PRODE 2003: 422-433 |
| 43 | EE | María Alpuente,
Santiago Escobar,
Salvador Lucas:
On-demand Evaluation by Program Transformation.
Electr. Notes Theor. Comput. Sci. 86(2): (2003) |
| 42 | EE | María Alpuente,
Santiago Escobar,
Salvador Lucas:
OnDemandOBJ: A Laboratory for Strategy Annotations.
Electr. Notes Theor. Comput. Sci. 86(2): (2003) |
| 41 | EE | María Alpuente,
Demis Ballis,
Santiago Escobar,
Moreno Falaschi,
Salvador Lucas:
Abstract correction of first-order functional programs.
Electr. Notes Theor. Comput. Sci. 86(3): (2003) |
| 40 | EE | Bernhard Gramlich,
Salvador Lucas:
3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings.
Electr. Notes Theor. Comput. Sci. 86(4): (2003) |
| 2002 |
|---|
| 39 | EE | Bernhard Gramlich,
Salvador Lucas:
Simple termination of context-sensitive rewriting.
ACM SIGPLAN Workshop on Rule-Based Programming 2002: 29-42 |
| 38 | EE | María Alpuente,
Santiago Escobar,
Salvador Lucas:
Removing Redundant Arguments of Functions.
AMAST 2002: 117-131 |
| 37 | EE | Cristina Borralleras,
Salvador Lucas,
Albert Rubio:
Recursive Path Orderings Can Be Context-Sensitive.
CADE 2002: 314-331 |
| 36 | EE | María Alpuente,
Marco Comini,
Santiago Escobar,
Moreno Falaschi,
Salvador Lucas:
Abstract Diagnosis of Functional Programs.
LOPSTR 2002: 1-16 |
| 35 | EE | María Alpuente,
Santiago Escobar,
Bernhard Gramlich,
Salvador Lucas:
Improving On-Demand Strategy Annotations.
LPAR 2002: 1-18 |
| 34 | EE | Bernhard Gramlich,
Salvador Lucas:
Modular termination of context-sensitive rewriting.
PPDP 2002: 50-61 |
| 33 | EE | Salvador Lucas:
Termination of (Canonical) Context-Sensitive Rewriting.
RTA 2002: 296-310 |
| 32 | EE | Salvador Lucas:
Lazy Rewriting and Context-Sensitive Rewriting.
Electr. Notes Theor. Comput. Sci. 64: (2002) |
| 31 | EE | Bernhard Gramlich,
Salvador Lucas:
Preface.
Electr. Notes Theor. Comput. Sci. 70(6): (2002) |
| 30 | EE | María Alpuente,
Santiago Escobar,
Salvador Lucas:
Correct and Complete (Positive) Strategy Annotations for OBJ.
Electr. Notes Theor. Comput. Sci. 71: (2002) |
| 29 | EE | Sergio Antoy,
Salvador Lucas:
Demandness in Rewriting and Narrowing.
Electr. Notes Theor. Comput. Sci. 76: (2002) |
| 28 | EE | María Alpuente,
Rachid Echahed,
Santiago Escobar,
Salvador Lucas:
Redundancy of Arguments Reduced to Induction.
Electr. Notes Theor. Comput. Sci. 76: (2002) |
| 27 | EE | Salvador Lucas:
Context-Sensitive Rewriting Strategies.
Inf. Comput. 178(1): 294-343 (2002) |
| 2001 |
|---|
| 26 | EE | Salvador Lucas:
Termination of Rewriting With Strategy Annotations.
LPAR 2001: 669-684 |
| 25 | | Salvador Lucas:
Termination of On-Demand Rewriting and Termination of OBJ Programs.
PPDP 2001: 82-93 |
| 24 | EE | Salvador Lucas:
Transfinite Rewriting Semantics for Term Rewriting Systems.
RTA 2001: 216-230 |
| 23 | EE | Bernhard Gramlich,
Salvador Lucas:
1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface.
Electr. Notes Theor. Comput. Sci. 57: (2001) |
| 22 | | Michael Hanus,
Salvador Lucas:
An Evaluation Semantics for Narrowing-Based Functional Logic Languages.
Journal of Functional and Logic Programming 2001(2): (2001) |
| 2000 |
|---|
| 21 | | Salvador Lucas:
Strong and NV-sequentiality of constructor systems.
WFLP 2000: 253-267 |
| 20 | | María Alpuente,
Santiago Escobar,
Salvador Lucas:
Redundancy Analyses in Term Rewriting.
WFLP 2000: 309-323 |
| 19 | | Salvador Lucas:
Redundant arguments in infinitary rewriting.
WFLP 2000: 340-343 |
| 1999 |
|---|
| 18 | | María Alpuente,
Salvador Lucas,
Santiago Escobar:
An Incremental Needed Narrowing Calculus for Curry.
APPIA-GULP-PRODE 1999: 75-88 |
| 17 | | Michael Hanus,
Salvador Lucas:
A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages.
Fuji International Symposium on Functional and Logic Programming 1999: 353-368 |
| 16 | EE | María Alpuente,
Michael Hanus,
Salvador Lucas,
Germán Vidal:
Specialization of Inductively Sequential Functional Logic Programs.
ICFP 1999: 273-283 |
| 15 | EE | María Alpuente,
Santiago Escobar,
Salvador Lucas:
UPV-CURRY: An Incremental CURRY Interpreter.
SOFSEM 1999: 331-339 |
| 1998 |
|---|
| 14 | EE | Michael Hanus,
Salvador Lucas,
Aart Middeldorp:
Strongly Sequential and Inductively Sequential Term Rewriting Systems.
Inf. Process. Lett. 67(1): 1-8 (1998) |
| 13 | EE | Salvador Lucas:
Root-Neededness and Approximations of Neededness.
Inf. Process. Lett. 67(5): 245-254 (1998) |
| 12 | | Salvador Lucas:
Context-sensitive Computations in Functional and Functional Logic Programs.
Journal of Functional and Logic Programming 1998(1): (1998) |
| 1997 |
|---|
| 11 | | Salvador Lucas:
Needed Reductions with Context-Sensitive Rewriting.
ALP/HOA 1997: 129-143 |
| 10 | | Salvador Lucas:
Computational Properties of Term Rewriting with Replacement Restrictions.
APPIA-GULP-PRODE 1997: 393-404 |
| 9 | | Salvador Lucas:
Transformations for Efficient Evaluations in Functional Programming.
PLILP 1997: 127-141 |
| 8 | | Salvador Lucas:
Efficient Strong Sequentiality Using Replacement Restrictions.
SOFSEM 1997: 489-496 |
| 1996 |
|---|
| 7 | | Michael Hanus,
Salvador Lucas:
A Denotational Semantics for Needed Narrowing.
APPIA-GULP-PRODE 1996: 259-270 |
| 6 | | Salvador Lucas:
Termination of Context-Sensitive Rewriting by Rewriting.
ICALP 1996: 122-133 |
| 5 | | Salvador Lucas:
Context-Sensitive Computations in Confluent Programs.
PLILP 1996: 408-422 |
| 4 | | Salvador Lucas,
Javier Oliver:
A New Proposal of Concurrent Process Calculus.
SOFSEM 1996: 385-392 |
| 1995 |
|---|
| 3 | | Salvador Lucas:
Computational Properties in Context-Sensitive Rewriting.
GULP-PRODE 1995: 435-446 |
| 2 | | Salvador Lucas:
Fundamentals of Context=Sensitive Rewriting.
SOFSEM 1995: 405-412 |
| 1994 |
|---|
| 1 | | Salvador Lucas,
Javier Oliver:
El lambda-calculo Etiquetado Paralelo (LCEP).
GULP-PRODE (1) 1994: 125-139 |
