Salvador Lucas - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Salvador Lucas' as author, editor, or advisor:

On decomposing MLPsS. Lucas, Z. Zhao, G. Cawley, P. Noakes. icnn 1993: 1414-1418 [doi]
Virtual Table Tennis and the Design of Neural Network PlayersD. d'Aulignac, A. Moschovinos, S. Lucas. icannga 1998: 445-448 [doi]
Generalizing Newman s Lemma for Left-Linear Rewrite SystemsBernhard Gramlich, Salvador Lucas. RTA 2006: 66-80 [doi]
The 2D Dependency Pair Framework for Conditional Rewrite Systems - Part II: Advanced Processors and Implementation TechniquesSalvador Lucas, José Meseguer, Raúl Gutiérrez. JAR, 64(8):1611-1662, 2020. [doi]
Transformations for Efficient Evaluations in Functional ProgrammingSalvador Lucas. plilp 1997: 127-141
Formal Verification of WebsitesSonia Flores, Salvador Lucas, Alicia Villanueva. ENTCS, 200(3):103-118, 2008. [doi]
Usable Rules for Context-Sensitive Rewrite SystemsRaúl Gutiérrez, Salvador Lucas, Xavier Urbain. RTA 2008: 126-141 [doi]
Web Services and Interoperability for the Maude Termination ToolFrancisco DurÃ¡n, Salvador Lucas, JosÃ© Meseguer, Francisco GutiÃ©rrez. ENTCS, 248:83-92, 2009. [doi]
Context-sensitive RewritingSalvador Lucas. ACM Comput. Surv., 53(4), 2020. [doi]
Methods for Proving Termination of Rewriting-based Programming Languages by TransformationFrancisco DurÃ¡n, Salvador Lucas, JosÃ© Meseguer. ENTCS, 248:93-113, 2009. [doi]
Confluence of Conditional Rewriting ModuloSalvador Lucas. csl 2024: [doi]
On-demand strategy annotations revisited: An improved on-demand evaluation strategyMar\'{\i}a Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas. Theor. Comput. Sci., 411(2), 2010.
Automatic Proofs of Termination With Elementary InterpretationsSalvador Lucas. ENTCS, 258(1):41-61, 2009. [doi]
Proving Termination Properties with mu-termBeatriz Alarcón, Raúl Gutiérrez, Salvador Lucas, Rafael Navarro-Marset. amast 2011: 201-208 [doi]
Analysis of Rewriting-Based Systems as First-Order TheoriesSalvador Lucas. LOPSTR 2018: 180-197 [doi]
Efficient Strong Sequentiality Using Replacement RestrictionsSalvador Lucas. sofsem 1997: 489-496
Removing Redundant Arguments of FunctionsMaría Alpuente, Santiago Escobar, Salvador Lucas. amast 2002: 117-131 [doi]
Proving and disproving confluence of context-sensitive rewritingSalvador Lucas, Miguel Vítores, Raúl Gutiérrez. jlap, 126:100749, 2022. [doi]
Derivational Complexity and Context-Sensitive RewritingSalvador Lucas. JAR, 65(8):1191-1229, 2021. [doi]
Strong and Weak Operational Termination of Order-Sorted Rewrite TheoriesSalvador Lucas, José Meseguer. WRLA 2014: 178-194 [doi]
Termination Modulo Combinations of Equational TheoriesFrancisco DurÃ¡n, Salvador Lucas, JosÃ© Meseguer. frocos 2009: 246-262 [doi]
Context-Sensitive Computations in Confluent ProgramsSalvador Lucas. plilp 1996: 408-422
The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processorsSalvador Lucas, José Meseguer, Raúl Gutiérrez. jcss, 96:74-106, 2018. [doi]
Computational Properties of Term Rewriting with Replacement RestrictionsSalvador Lucas. agp 1997: 393-404
Normal forms and normal theories in conditional rewritingSalvador Lucas, José Meseguer. jlp, 85(1):67-97, 2016. [doi]
Confluence Framework: Proving Confluence with CONFidentRaúl Gutiérrez, Miguel Vítores, Salvador Lucas. LOPSTR 2022: 24-43 [doi]
Extending the 2D Dependency Pair Framework for Conditional Term Rewriting SystemsSalvador Lucas, José Meseguer, Raúl Gutiérrez. LOPSTR 2015: 113-130 [doi]
2nd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2002, FLoC Satellite Event, Copenhagen, Denmark, July 21, 2002, Final ProceedingsBernhard Gramlich, Salvador Lucas, editors, Volume 70 of Electronic Notes in Theoretical Computer Science, Elsevier, 2002. [doi]
Computational Properties in Context-Sensitive RewritingSalvador Lucas. agp 1995: 435-446
On-demand strategy annotations revisited: An improved on-demand evaluation strategyMaría Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas. TCS, 411(2):504-541, 2010. [doi]
SAT Modulo Linear Arithmetic for Solving Polynomial ConstraintsCristina Borralleras, Salvador Lucas, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio. JAR, 48(1):107-131, 2012. [doi]
Using Well-Founded Relations for Proving Operational TerminationSalvador Lucas. JAR, 64(2):167-195, 2020. [doi]
Termination of On-Demand Rewriting and Termination of OBJ ProgramsSalvador Lucas. ppdp 2001: 82-93
Using Representation Theorems for Proving Polynomials Non-negativeSalvador Lucas. AISC 2014: 21-33 [doi]
Operational Termination of Membership Equational Programs: the Order-Sorted WaySalvador Lucas, José Meseguer. ENTCS, 238(3):207-225, 2009. [doi]
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear ArithmeticCristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric RodrÃguez-Carbonell, Albert Rubio. cade 2009: 294-305 [doi]
Proceedings of the Fourth Spanish Conference on Programming and Computer Languages, PROLE 2004, Málaga, Spain, November 10-12, 2004Salvador Lucas, editor, Volume 137 of Electronic Notes in Theoretical Computer Science, Elsevier, 2005. [doi]
A Dependency Pair Framework for ::::A:::: OR ::::C::::-TerminationBeatriz Alarcón, Salvador Lucas, José Meseguer. WRLA 2010: 35-51 [doi]
Function Calls at Frozen Positions in Termination of Context-Sensitive RewritingRaúl Gutiérrez, Salvador Lucas. BIRTHDAY 2015: 311-330 [doi]
Lazy Rewriting and Context-Sensitive RewritingSalvador Lucas. ENTCS, 64:234-254, 2002. [doi]
Redundancy Analyses in Term RewritingMaría Alpuente, Santiago Escobar, Salvador Lucas. wflp 2000: 309-323
Polynomials over the reals in proofs of termination: from theory to practiceSalvador Lucas. ita, 39(3):547-586, 2005. [doi]
Automatic Synthesis of Logical Models for Order-Sorted First-Order TheoriesSalvador Lucas, Raúl Gutiérrez. JAR, 60(4):465-501, 2018. [doi]
Proving termination of context-sensitive rewriting by transformationSalvador Lucas. iandc, 204(12):1782-1846, 2006. [doi]
Modular termination of context-sensitive rewritingBernhard Gramlich, Salvador Lucas. ppdp 2002: 50-61 [doi]
The origins of the halting problemSalvador Lucas. jlap, 121:100687, 2021. [doi]
Proving Termination in the Context-Sensitive Dependency Pair FrameworkRaúl Gutiérrez, Salvador Lucas. WRLA 2010: 18-34 [doi]
Polynomials for Proving Termination of Context-Sensitive RewritingSalvador Lucas. fossacs 2004: 318-332 [doi]
Proving Semantic Properties as First-Order Satisfiability (Extended Abstract)Salvador Lucas. IJCAI 2020: 5075-5079 [doi]
Localized Operational Termination in General LogicsSalvador Lucas, José Meseguer. BIRTHDAY 2015: 91-114 [doi]
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination ProversSalvador Lucas, Rafael Navarro-Marset. ENTCS, 206:75-90, 2008. [doi]
UPV-CURRY: An Incremental CURRY InterpreterMaría Alpuente, Santiago Escobar, Salvador Lucas. sofsem 1999: 331-339 [doi]
Use of Logical Models for Proving Operational Termination in General LogicsSalvador Lucas. WRLA 2016: 26-46 [doi]
Termination of (Canonical) Context-Sensitive RewritingSalvador Lucas. RTA 2002: 296-310 [doi]
Reduction strategies in rewriting and programmingBernhard Gramlich, Salvador Lucas. JSC, 40(1):745-747, 2005. [doi]
Automatic Generation of Logical Models with AGESRaúl Gutiérrez, Salvador Lucas. cade 2019: 287-299 [doi]
Context-sensitive dependency pairsBeatriz Alarcón, Raúl Gutiérrez, Salvador Lucas. iandc, 208(8):922-968, 2010. [doi]
Order-sorted dependency pairsSalvador Lucas, José Meseguer. ppdp 2008: 108-119 [doi]
Proving Termination of Context-Sensitive Rewriting with MU-TERMBeatriz Alarcón, Raúl Gutiérrez, José Iborra, Salvador Lucas. ENTCS, 188:105-115, 2007. [doi]
From Matrix Interpretations over the Rationals to Matrix Interpretations over the NaturalsSalvador Lucas. AISC 2010: 116-131 [doi]
Automatically Proving and Disproving Feasibility ConditionsRaúl Gutiérrez, Salvador Lucas. cade 2020: 416-435 [doi]
2D Dependency Pairs for Proving Operational Termination of CTRSsSalvador Lucas, José Meseguer. WRLA 2014: 195-212 [doi]
Confluence of Conditional Rewriting in Logic FormRaúl Gutiérrez, Salvador Lucas, Miguel Vítores. fsttcs 2021: [doi]
Dependency pairs for proving termination properties of conditional term rewriting systemsSalvador Lucas, José Meseguer. jlp, 86(1):236-268, 2017. [doi]
mu-term: Verify Termination Properties Automatically (System Description)Raúl Gutiérrez, Salvador Lucas. cade 2020: 436-447 [doi]
Local confluence of conditional and generalized term rewriting systemsSalvador Lucas. jlap, 136:100926, January 2024. [doi]
Use of logical models for proving infeasibility in term rewritingSalvador Lucas, Raúl Gutiérrez. ipl, 136:90-95, 2018. [doi]
Proving Program Properties as First-Order SatisfiabilitySalvador Lucas. LOPSTR 2019: 3-21 [doi]
Context-sensitive Computations in Functional and Functional Logic ProgramsSalvador Lucas. jflp, 1998(1), 1998.
Applications and extensions of context-sensitive rewritingSalvador Lucas. jlap, 121:100680, 2021. [doi]
Proving termination of membership equational programsFrancisco Durán, Salvador Lucas, José Meseguer, Claude Marché, Xavier Urbain. PEPM 2004: 147-158 [doi]
Proving semantic properties as first-order satisfiabilitySalvador Lucas. ai, 277, 2019. [doi]
1st International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2001, Utrecht, The Netherlands, May 26, 2001Bernhard Gramlich, Salvador Lucas, editors, Volume 57 of Electronic Notes in Theoretical Computer Science, Elsevier, 2001. [doi]
Proving Operational Termination of Declarative Programs in General LogicsSalvador Lucas, José Meseguer. ppdp 2014: 111-122 [doi]
Needed Reductions with Context-Sensitive RewritingSalvador Lucas. icalp 1997: 129-143
PrefaceSalvador Lucas. ENTCS, 137(1):1-3, 2005. [doi]
Models for Logics and Conditional Constraints in Automated Proofs of TerminationSalvador Lucas, José Meseguer. AISC 2014: 9-20 [doi]
3rd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2003, Valencia, Spain, June 8, 2003, Final ProceedingsBernhard Gramlich, Salvador Lucas, editors, Volume 86 of Electronic Notes in Theoretical Computer Science, Elsevier, 2003. [doi]
An Incremental Needed Narrowing Calculus for CurryMaría Alpuente, Salvador Lucas, Santiago Escobar. agp 1999: 75-88
Completeness of context-sensitive rewritingSalvador Lucas. ipl, 115(2):87-92, 2015. [doi]
Operational termination of conditional term rewriting systemsSalvador Lucas, Claude Marché, José Meseguer. ipl, 95(4):446-453, 2005. [doi]
Search Techniques for Rational Polynomial OrdersCarsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp. AISC 2008: 109-124 [doi]
Using Context-Sensitive Rewriting for Proving Innermost Termination of RewritingBeatriz AlarcÃ³n, Salvador Lucas. ENTCS, 248:3-17, 2009. [doi]

runs on WebDSL