Travelled to:1 × Australia
1 × Austria
1 × Canada
1 × Cyprus
1 × Japan
1 × Poland
1 × The Netherlands
2 × Denmark
2 × France
2 × Italy
2 × USA
3 × Germany
3 × Spain
4 × United Kingdom
Collaborated with:∅ J.Meseguer R.Gutiérrez B.Gramlich F.Durán S.Escobar M.Alpuente M.Hanus C.Borralleras A.Rubio X.Urbain B.Alarcón G.Vidal R.Navarro-Marset E.Rodríguez-Carbonell C.Marché M.Comini M.Falaschi
Talks about:termin (16) rewrit (14) context (10) sensit (10) program (9) prove (6) depend (5) pair (5) function (4) system (4)
Person: Salvador Lucas
DBLP: Lucas:Salvador
Contributed to:
2014
2014
20142010
2009
20082008
2008200920072006
2004
2004200420052002200220022002200220012001
1999
199919971997
199619962019Wrote 31 papers:
- LOPSTR-2014-LucasMG #2d #dependence #framework #term rewriting
- Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems (SL, JM, RG), pp. 113–130.
- PPDP-2014-LucasM #declarative #logic #proving #source code #termination
- Proving Operational Termination of Declarative Programs in General Logics (SL, JM), pp. 111–122.
- WRLA-2014-LucasM #order #termination
- Strong and Weak Operational Termination of Order-Sorted Rewrite Theories (SL, JM), pp. 178–194.
- WRLA-2014-LucasM14a #2d #dependence #proving #termination
- 2D Dependency Pairs for Proving Operational Termination of CTRSs (SL, JM), pp. 195–212.
- WRLA-2010-AlarconLM #dependence #framework
- A Dependency Pair Framework for A OR C-Termination (BA, SL, JM), pp. 35–51.
- WRLA-2010-GutierrezL #dependence #framework #proving #termination
- Proving Termination in the Context-Sensitive Dependency Pair Framework (RG, SL), pp. 18–34.
- CADE-2009-BorrallerasLNRR #linear #polynomial #satisfiability
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (CB, SL, RNM, ERC, AR), pp. 294–305.
- IJCAR-2008-DuranLM #maude #named #termination
- MTT: The Maude Termination Tool (FD, SL, JM), pp. 313–319.
- PPDP-2008-LucasM #dependence #order
- Order-sorted dependency pairs (SL, JM), pp. 108–119.
- RTA-2008-GutierrezLU #term rewriting
- Usable Rules for Context-Sensitive Rewrite Systems (RG, SL, XU), pp. 126–141.
- WRLA-2008-LucasM09 #equation #order #source code #termination
- Operational Termination of Membership Equational Programs: the Order-Sorted Way (SL, JM), pp. 207–225.
- PPDP-2007-Lucas #proving #termination #using
- Practical use of polynomials over the reals in proofs of termination (SL), pp. 39–50.
- RTA-2006-GramlichL #linear #term rewriting
- Generalizing Newman’s Lemma for Left-Linear Rewrite Systems (BG, SL), pp. 66–80.
- FoSSaCS-2004-Lucas #proving #termination
- Polynomials for Proving Termination of Context-Sensitive Rewriting (SL), pp. 318–332.
- PEPM-2004-DuranLMMU #equation #proving #source code #termination
- Proving termination of membership equational programs (FD, SL, JM, CM, XU), pp. 147–158.
- RTA-2004-Lucas #named #proving #termination
- mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting (SL), pp. 200–209.
- WRLA-2004-DuranEL05 #evaluation #maude
- New Evaluation Commands for Maude Within Full Maude (FD, SE, SL), pp. 263–284.
- CADE-2002-BorrallerasLR #order #recursion
- Recursive Path Orderings Can Be Context-Sensitive (CB, SL, AR), pp. 314–331.
- LOPSTR-2002-AlpuenteCEFL #functional #source code
- Abstract Diagnosis of Functional Programs (MA, MC, SE, MF, SL), pp. 1–16.
- PPDP-2002-GramlichL #composition #termination
- Modular termination of context-sensitive rewriting (BG, SL), pp. 50–61.
- RTA-2002-Lucas #canonical #termination
- Termination of (Canonical) Context-Sensitive Rewriting (SL), pp. 296–310.
- WRLA-2002-AlpuenteEL
- Correct and Complete (Positive) Strategy Annotations for OBJ (MA, SE, SL), pp. 70–89.
- PPDP-2001-Lucas #on-demand #source code #termination
- Termination of On-Demand Rewriting and Termination of OBJ Programs (SL), pp. 82–93.
- RTA-2001-Lucas #semantics #term rewriting
- Transfinite Rewriting Semantics for Term Rewriting Systems (SL), pp. 216–230.
- FLOPS-1999-HanusL #functional #logic #program analysis #semantics
- A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages (MH, SL), pp. 353–368.
- ICFP-1999-AlpuenteHLV #functional #logic programming #source code
- Specialization of Inductively Sequential Functional Logic Programs (MA, MH, SL, GV), pp. 273–283.
- ALP-1997-Lucas #reduction
- Needed Reductions with Context-Sensitive Rewriting (SL), pp. 129–143.
- PLILP-1997-Lucas #functional #performance #programming
- Transformations for Efficient Evaluations in Functional Programming (SL), pp. 127–141.
- ICALP-1996-Lucas #termination
- Termination of Context-Sensitive Rewriting by Rewriting (SL), pp. 122–133.
- PLILP-1996-Lucas #confluence #source code
- Context-Sensitive Computations in Confluent Programs (SL), pp. 408–422.
- CADE-2019-GutierrezL #automation #generative #logic #modelling
- Automatic Generation of Logical Models with AGES (RG, SL), pp. 287–299.