| 2012 | ||
|---|---|---|
| j42 | Cristina Borralleras, Salvador Lucas, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio: SAT Modulo Linear Arithmetic for Solving Polynomial Constraints. J. Autom. Reasoning 48(1): 107-131 (2012) | |
| 2010 | ||
| j41 | Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas: Context-sensitive dependency pairs. Inf. Comput. 208(8): 922-968 (2010) | |
| j40 | María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas: On-demand strategy annotations revisited: An improved on-demand evaluation strategy. Theor. Comput. Sci. 411(2): 504-541 (2010) | |
| c50 | Salvador Lucas: From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals. AISC/MKM/Calculemus 2010: 116-131 | |
| c49 | Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas, Rafael Navarro-Marset: Proving Termination Properties with mu-term. AMAST 2010: 201-208 | |
| c48 | Raúl Gutiérrez, Salvador Lucas: Proving Termination in the Context-Sensitive Dependency Pair Framework. WRLA 2010: 18-34 | |
| c47 | Beatriz Alarcón, Salvador Lucas, José Meseguer: A Dependency Pair Framework for A OR C-Termination. WRLA 2010: 35-51 | |
| i3 | Salvador Lucas: From matrix interpretations over the rationals to matrix interpretations over the naturals. CoRR abs/1007.0143 (2010) | |
| 2009 | ||
| j39 | Salvador Lucas, José Meseguer: Operational Termination of Membership Equational Programs: the Order-Sorted Way. Electr. Notes Theor. Comput. Sci. 238(3): 207-225 (2009) | |
| j38 | Beatriz Alarcón, Salvador Lucas: Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting. Electr. Notes Theor. Comput. Sci. 248: 3-17 (2009) | |
| j37 | Francisco Durán, Salvador Lucas, José Meseguer, Francisco Gutiérrez: Web Services and Interoperability for the Maude Termination Tool. Electr. Notes Theor. Comput. Sci. 248: 83-92 (2009) | |
| j36 | Francisco Durán, Salvador Lucas, José Meseguer: Methods for Proving Termination of Rewriting-based Programming Languages by Transformation. Electr. Notes Theor. Comput. Sci. 248: 93-113 (2009) | |
| j35 | Salvador Lucas: Automatic Proofs of Termination With Elementary Interpretations. Electr. Notes Theor. Comput. Sci. 258(1): 41-61 (2009) | |
| c46 | Cristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric Rodríguez-Carbonell, Albert Rubio: Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. CADE 2009: 294-305 | |
| c45 | Francisco Durán, Salvador Lucas, José Meseguer: Termination Modulo Combinations of Equational Theories. FroCoS 2009: 246-262 | |
| 2008 | ||
| j34 | Sonia Flores, Salvador Lucas, Alicia Villanueva: Formal Verification of Websites. Electr. Notes Theor. Comput. Sci. 200(3): 103-118 (2008) | |
| j33 | 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) | |
| j32 | Salvador Lucas, José Meseguer: Termination of just/fair computations in term rewriting. Inf. Comput. 206(5): 652-675 (2008) | |
| j31 | 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) | |
| c44 | 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 | |
| c43 | Francisco Durán, Salvador Lucas, José Meseguer: MTT: The Maude Termination Tool (System Description). IJCAR 2008: 313-319 | |
| c42 | 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 | |
| c41 | ||
| c40 | Raúl Gutiérrez, Salvador Lucas, Xavier Urbain: Usable Rules for Context-Sensitive Rewrite Systems. RTA 2008: 126-141 | |
| 2007 | ||
| j30 | Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas: Improving the Context-sensitive Dependency Graph. Electr. Notes Theor. Comput. Sci. 188: 91-103 (2007) | |
| j29 | 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) | |
| j28 | María Alpuente, Santiago Escobar, Salvador Lucas: Removing redundant arguments automatically. TPLP 7(1-2): 3-35 (2007) | |
| c39 | Manuel Clavel, Francisco Durán, Joe Hendrix, Salvador Lucas, José Meseguer, Peter Csaba Ölveczky: The Maude Formal Tool Environment. CALCO 2007: 173-178 | |
| c38 | Beatriz Alarcón, Salvador Lucas: Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs. FroCoS 2007: 73-87 | |
| c37 | Salvador Lucas: Practical use of polynomials over the reals in proofs of termination. PPDP 2007: 39-50 | |
| 2006 | ||
| j27 | 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) | |
| j26 | Salvador Lucas: Rewriting-Based Navigation of Web Sites: Looking for Models and Logics. Electr. Notes Theor. Comput. Sci. 157(2): 79-85 (2006) | |
| j25 | Salvador Lucas: Proving termination of context-sensitive rewriting by transformation. Inf. Comput. 204(12): 1782-1846 (2006) | |
| c36 | Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas: Context-Sensitive Dependency Pairs. FSTTCS 2006: 297-308 | |
| c35 | Bernhard Gramlich, Salvador Lucas: Generalizing Newman's Lemma for Left-Linear Rewrite Systems. RTA 2006: 66-80 | |
| i2 | María Alpuente, Santiago Escobar, Salvador Lucas: Removing Redundant Arguments Automatically. CoRR abs/cs/0601039 (2006) | |
| 2005 | ||
| j24 | Francisco Durán, Santiago Escobar, Salvador Lucas: New Evaluation Commands for Maude Within Full Maude. Electr. Notes Theor. Comput. Sci. 117: 263-284 (2005) | |
| j23 | Francisco Durán, Santiago Escobar, Salvador Lucas: On-demand Evaluation for Maude. Electr. Notes Theor. Comput. Sci. 124(1): 25-39 (2005) | |
| j22 | Salvador Lucas: Strategies in Programming Languages Today. Electr. Notes Theor. Comput. Sci. 124(2): 113-118 (2005) | |
| j21 | ||
| j20 | Salvador Lucas, Claude Marché, José Meseguer: Operational termination of conditional term rewriting systems. Inf. Process. Lett. 95(4): 446-453 (2005) | |
| j19 | Salvador Lucas: Polynomials over the reals in proofs of termination: from theory to practice. ITA 39(3): 547-586 (2005) | |
| j18 | Bernhard Gramlich, Salvador Lucas: Reduction strategies in rewriting and programming. J. Symb. Comput. 40(1): 745-747 (2005) | |
| j17 | 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) | |
| c34 | Salvador Lucas, José Meseguer: Termination of Fair Computations in Term Rewriting. LPAR 2005: 184-198 | |
| c33 | ||
| 2004 | ||
| j16 | Salvador Lucas: Strong and NV-sequentiality of constructor systems. Inf. Process. Lett. 89(4): 191-201 (2004) | |
| c32 | Salvador Lucas: Polynomials for Proving Termination of Context-Sensitive Rewriting. FoSSaCS 2004: 318-332 | |
| c31 | Francisco Durán, Salvador Lucas, José Meseguer, Claude Marché, Xavier Urbain: Proving termination of membership equational programs. PEPM 2004: 147-158 | |
| c30 | Salvador Lucas: mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. RTA 2004: 200-209 | |
| i1 | María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal: Specialization of Functional Logic Programs Based on Needed Narrowing. CoRR cs.PL/0403011 (2004) | |
| 2003 | ||
| j15 | María Alpuente, Santiago Escobar, Salvador Lucas: OnDemandOBJ: A Laboratory for Strategy Annotations. Electr. Notes Theor. Comput. Sci. 86(2): 1-27 (2003) | |
| j14 | María Alpuente, Santiago Escobar, Salvador Lucas: On-demand Evaluation by Program Transformation. Electr. Notes Theor. Comput. Sci. 86(2): 92-118 (2003) | |
| j13 | 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): 105-122 (2003) | |
| j12 | Bernhard Gramlich, Salvador Lucas: Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. Electr. Notes Theor. Comput. Sci. 86(4): 567-569 (2003) | |
| c29 | María Alpuente, Demis Ballis, Santiago Escobar, Moreno Falaschi, Salvador Lucas: Abstract Correction of OBJ-like Programs. APPIA-GULP-PRODE 2003: 422-433 | |
| 2002 | ||
| j11 | Salvador Lucas: Lazy Rewriting and Context-Sensitive Rewriting. Electr. Notes Theor. Comput. Sci. 64: 234-254 (2002) | |
| j10 | ||
| j9 | María Alpuente, Santiago Escobar, Salvador Lucas: Correct and Complete (Positive) Strategy Annotations for OBJ. Electr. Notes Theor. Comput. Sci. 71: 70-89 (2002) | |
| j8 | María Alpuente, Rachid Echahed, Santiago Escobar, Salvador Lucas: Redundancy of Arguments Reduced to Induction. Electr. Notes Theor. Comput. Sci. 76: 20-41 (2002) | |
| j7 | Sergio Antoy, Salvador Lucas: Demandness in Rewriting and Narrowing. Electr. Notes Theor. Comput. Sci. 76: 42-51 (2002) | |
| j6 | ||
| c28 | María Alpuente, Santiago Escobar, Salvador Lucas: Removing Redundant Arguments of Functions. AMAST 2002: 117-131 | |
| c27 | Cristina Borralleras, Salvador Lucas, Albert Rubio: Recursive Path Orderings Can Be Context-Sensitive. CADE 2002: 314-331 | |
| c26 | María Alpuente, Marco Comini, Santiago Escobar, Moreno Falaschi, Salvador Lucas: Abstract Diagnosis of Functional Programs. LOPSTR 2002: 1-16 | |
| c25 | María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas: Improving On-Demand Strategy Annotations. LPAR 2002: 1-18 | |
| c24 | Bernhard Gramlich, Salvador Lucas: Modular termination of context-sensitive rewriting. PPDP 2002: 50-61 | |
| c23 | ||
| c22 | Bernhard Gramlich, Salvador Lucas: Simple termination of context-sensitive rewriting. ACM SIGPLAN Workshop on Rule-Based Programming 2002: 29-42 | |
| 2001 | ||
| j5 | Michael Hanus, Salvador Lucas: An Evaluation Semantics for Narrowing-Based Functional Logic Languages. Journal of Functional and Logic Programming 2001(2) (2001) | |
| j4 | Bernhard Gramlich, Salvador Lucas: 1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface. Electr. Notes Theor. Comput. Sci. 57: 201-202 (2001) | |
| c21 | ||
| c20 | Salvador Lucas: Termination of On-Demand Rewriting and Termination of OBJ Programs. PPDP 2001: 82-93 | |
| c19 | ||
| 2000 | ||
| c18 | ||
| c17 | María Alpuente, Santiago Escobar, Salvador Lucas: Redundancy Analyses in Term Rewriting. WFLP 2000: 309-323 | |
| c16 | ||
| 1999 | ||
| c15 | María Alpuente, Salvador Lucas, Santiago Escobar: An Incremental Needed Narrowing Calculus for Curry. APPIA-GULP-PRODE 1999: 75-88 | |
| c14 | 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 | |
| c13 | María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal: Specialization of Inductively Sequential Functional Logic Programs. ICFP 1999: 273-283 | |
| c12 | María Alpuente, Santiago Escobar, Salvador Lucas: UPV-CURRY: An Incremental CURRY Interpreter. SOFSEM 1999: 331-339 | |
| 1998 | ||
| j3 | Michael Hanus, Salvador Lucas, Aart Middeldorp: Strongly Sequential and Inductively Sequential Term Rewriting Systems. Inf. Process. Lett. 67(1): 1-8 (1998) | |
| j2 | Salvador Lucas: Root-Neededness and Approximations of Neededness. Inf. Process. Lett. 67(5): 245-254 (1998) | |
| j1 | Salvador Lucas: Context-sensitive Computations in Functional and Functional Logic Programs. Journal of Functional and Logic Programming 1998(1) (1998) | |
| 1997 | ||
| c11 | Salvador Lucas: Computational Properties of Term Rewriting with Replacement Restrictions. APPIA-GULP-PRODE 1997: 393-404 | |
| c10 | ||
| c9 | Salvador Lucas: Transformations for Efficient Evaluations in Functional Programming. PLILP 1997: 127-141 | |
| c8 | ||
| 1996 | ||
| c7 | Michael Hanus, Salvador Lucas: A Denotational Semantics for Needed Narrowing. APPIA-GULP-PRODE 1996: 259-270 | |
| c6 | ||
| c5 | ||
| c4 | ||
| 1995 | ||
| c3 | ||
| c2 | ||
| 1994 | ||
| c1 | Salvador Lucas, Javier Oliver: El lambda-calculo Etiquetado Paralelo (LCEP). GULP-PRODE (1) 1994: 125-139 | |
Data released under the ODC-BY 1.0 license — See also our legal information page