Salvador Lucas

143 papers A* 2A 6B 12C 11Misc 2Journal 42Unranked 64

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Should computations halt? J. Log. Algebraic Methods Program. Salvador Lucas
2025	A	`conf`	Confluence of Almost Parallel-Closed Generalized Term Rewriting Systems. CADE Salvador Lucas
2025	J	`jnl`	Confluence of Conditional Rewriting Modulo. CoRR Salvador Lucas
2025	—	`conf`	Semantic Properties of Computations Defined by Elementary Inference Systems. HCVS@CAV Salvador Lucas
2024	B	`conf`	Confluence of Conditional Rewriting Modulo. CSL Salvador Lucas
2024	J	`jnl`	Local confluence of conditional and generalized term rewriting systems. J. Log. Algebraic Methods Program. Salvador Lucas
2024	J	`jnl`	Proving Confluence in the Confluence Framework with CONFident. Fundam. Informaticae Raúl Gutiérrez, Salvador Lucas, Miguel Vítores
2024	B	`conf`	Termination of Generalized Term Rewriting Systems. FSCD Salvador Lucas
2023	J	`jnl`	Proving Confluence in the Confluence Framework with CONFident. CoRR Raúl Gutiérrez, Salvador Lucas, Miguel Vítores
2022	C	`conf`	Confluence Framework: Proving Confluence with CONFident. LOPSTR Raúl Gutiérrez, Miguel Vítores, Salvador Lucas
2022	J	`jnl`	Proving and disproving confluence of context-sensitive rewriting. J. Log. Algebraic Methods Program. Salvador Lucas, Miguel Vítores, Raúl Gutiérrez
2021	J	`jnl`	Applications and extensions of context-sensitive rewriting. J. Log. Algebraic Methods Program. Salvador Lucas
2021	—	`conf`	Confluence of Conditional Rewriting in Logic Form. FSTTCS Raúl Gutiérrez, Salvador Lucas, Miguel Vítores
2021	J	`jnl`	Context-sensitive Rewriting. ACM Comput. Surv. Salvador Lucas
2021	J	`jnl`	Derivational Complexity and Context-Sensitive Rewriting. J. Autom. Reason. Salvador Lucas
2021	J	`jnl`	The origins of the halting problem. J. Log. Algebraic Methods Program. Salvador Lucas
2020	—	`conf`	Automatically Proving and Disproving Feasibility Conditions. IJCAR (2) Raúl Gutiérrez, Salvador Lucas
2020	A*	`conf`	Proving Semantic Properties as First-Order Satisfiability (Extended Abstract). IJCAI Salvador Lucas
2020	J	`jnl`	The 2D Dependency Pair Framework for Conditional Rewrite Systems - Part II: Advanced Processors and Implementation Techniques. J. Autom. Reason. Salvador Lucas, José Meseguer, Raúl Gutiérrez
2020	J	`jnl`	Using Well-Founded Relations for Proving Operational Termination. J. Autom. Reason. Salvador Lucas
2020	—	`conf`	mu-term: Verify Termination Properties Automatically (System Description). IJCAR (2) Raúl Gutiérrez, Salvador Lucas
2019	A	`conf`	Automatic Generation of Logical Models with AGES. CADE Raúl Gutiérrez, Salvador Lucas
2019	J	`jnl`	Proving semantic properties as first-order satisfiability. Artif. Intell. Salvador Lucas
2018	J	`jnl`	Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories. J. Autom. Reason. Salvador Lucas, Raúl Gutiérrez
2018	C	`conf`	Proving Program Properties as First-Order Satisfiability. LOPSTR Salvador Lucas
2018	J	`jnl`	Proving Program Properties as First-Order Satisfiability. CoRR Salvador Lucas
2018	J	`jnl`	The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processors. J. Comput. Syst. Sci. Salvador Lucas, José Meseguer, Raúl Gutiérrez
2018	J	`jnl`	Use of logical models for proving infeasibility in term rewriting. Inf. Process. Lett. Salvador Lucas, Raúl Gutiérrez
2017	J	`jnl`	A Semantic Approach to the Analysis of Rewriting-Based Systems. CoRR Salvador Lucas
2017	C	`conf`	Analysis of Rewriting-Based Systems as First-Order Theories. LOPSTR Salvador Lucas
2017	J	`jnl`	Dependency pairs for proving termination properties of conditional term rewriting systems. J. Log. Algebraic Methods Program. Salvador Lucas, José Meseguer
2016	J	`jnl`	Normal forms and normal theories in conditional rewriting. J. Log. Algebraic Methods Program. Salvador Lucas, José Meseguer
2016	—	`conf`	Use of Logical Models for Proving Operational Termination in General Logics. WRLA Salvador Lucas
2015	J	`jnl`	Completeness of context-sensitive rewriting. Inf. Process. Lett. Salvador Lucas
2015	—	`conf`	Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting. Logic, Rewriting, and Concurrency Raúl Gutiérrez, Salvador Lucas
2015	—	`conf`	Localized Operational Termination in General Logics. Software, Services, and Systems Salvador Lucas, José Meseguer
2015	—	`conf`	Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving. PROLE Salvador Lucas
2015	—	`conf`	Termination of canonical context-sensitive rewriting and productivity of rewrite systems. PROLE Salvador Lucas
2014	—	`conf`	2D Dependency Pairs for Proving Operational Termination of CTRSs. WRLA Salvador Lucas, José Meseguer
2014	C	`conf`	Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems. LOPSTR Salvador Lucas, José Meseguer, Raúl Gutiérrez
2014	Misc	`conf`	Models for Logics and Conditional Constraints in Automated Proofs of Termination. AISC Salvador Lucas, José Meseguer
2014	C	`conf`	Proving Operational Termination of Declarative Programs in General Logics. PPDP Salvador Lucas, José Meseguer
2014	—	`conf`	Strong and Weak Operational Termination of Order-Sorted Rewrite Theories. WRLA Salvador Lucas, José Meseguer
2014	Misc	`conf`	Using Representation Theorems for Proving Polynomials Non-negative. AISC Salvador Lucas
2012	J	`jnl`	SAT Modulo Linear Arithmetic for Solving Polynomial Constraints. J. Autom. Reason. Cristina Borralleras, Salvador Lucas, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio
2010	—	`conf`	A Dependency Pair Framework for WRLA Beatriz Alarcón, Salvador Lucas, José Meseguer
2010	J	`jnl`	Context-sensitive dependency pairs. Inf. Comput. Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
2010	—	`conf`	From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals. AISC/MKM/Calculemus Salvador Lucas
2010	J	`jnl`	From matrix interpretations over the rationals to matrix interpretations over the naturals CoRR Salvador Lucas
2010	J	`jnl`	On-demand strategy annotations revisited: An improved on-demand evaluation strategy. Theor. Comput. Sci. María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas
2010	—	`conf`	Proving Termination Properties with mu-term. AMAST Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas, Rafael Navarro-Marset
2010	—	`conf`	Proving Termination in the Context-Sensitive Dependency Pair Framework. WRLA Raúl Gutiérrez, Salvador Lucas
2009	—	`conf`	Automatic Proofs of Termination With Elementary Interpretations. PROLE Salvador Lucas
2009	A	`conf`	Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. CADE Cristina Borralleras, Salvador Lucas, Rafael Navarro-Marset, Enric Rodríguez-Carbonell, Albert Rubio
2009	—	`conf`	Termination Modulo Combinations of Equational Theories. FroCoS Francisco Durán, Salvador Lucas, José Meseguer
2008	B	`conf`	Improving Context-Sensitive Dependency Pairs. LPAR Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann
2008	A	`conf`	MTT: The Maude Termination Tool (System Description). IJCAR Francisco Durán, Salvador Lucas, José Meseguer
2008	—	`conf`	Methods for Proving Termination of Rewriting-based Programming Languages by Transformation. PROLE Francisco Durán, Salvador Lucas, José Meseguer
2008	—	`conf`	Operational Termination of Membership Equational Programs: the Order-Sorted Way. WRLA Salvador Lucas, José Meseguer
2008	C	`conf`	Order-sorted dependency pairs. PPDP Salvador Lucas, José Meseguer
2008	J	`jnl`	Proving operational termination of membership equational programs. High. Order Symb. Comput. Francisco Durán, Salvador Lucas, Claude Marché, José Meseguer, Xavier Urbain
2008	—	`conf`	Search Techniques for Rational Polynomial Orders. AISC/MKM/Calculemus Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp
2008	J	`jnl`	Termination of just/fair computations in term rewriting. Inf. Comput. Salvador Lucas, José Meseguer
2008	—	`conf`	Usable Rules for Context-Sensitive Rewrite Systems. RTA Raúl Gutiérrez, Salvador Lucas, Xavier Urbain
2008	—	`conf`	Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting. PROLE Beatriz Alarcón, Salvador Lucas
2008	—	`conf`	Web Services and Interoperability for the Maude Termination Tool. PROLE Francisco Durán, Salvador Lucas, José Meseguer, Francisco Gutiérrez
2007	—	`conf`	Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers. PROLE Salvador Lucas, Rafael Navarro-Marset
2007	—	`conf`	Formal Verification of Websites. WWV Sonia Flores, Salvador Lucas, Alicia Villanueva
2007	C	`conf`	Practical use of polynomials over the reals in proofs of termination. PPDP Salvador Lucas
2007	J	`jnl`	Removing redundant arguments automatically. Theory Pract. Log. Program. María Alpuente, Santiago Escobar, Salvador Lucas
2007	—	`conf`	Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs. FroCoS Beatriz Alarcón, Salvador Lucas
2007	B	`conf`	The Maude Formal Tool Environment. CALCO Manuel Clavel, Francisco Durán, Joe Hendrix, Salvador Lucas, José Meseguer, Peter Csaba Ölveczky
2006	—	`conf`	Context-Sensitive Dependency Pairs. FSTTCS Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
2006	—	`conf`	Generalizing Newman's Lemma for Left-Linear Rewrite Systems. RTA Bernhard Gramlich, Salvador Lucas
2006	—	`conf`	Improving the Context-sensitive Dependency Graph. PROLE Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
2006	J	`jnl`	On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting. Appl. Algebra Eng. Commun. Comput. Salvador Lucas
2006	—	`conf`	Proving Termination of Context-Sensitive Rewriting with MU-TERM. PROLE Beatriz Alarcón, Raúl Gutiérrez, José Iborra, Salvador Lucas
2006	J	`jnl`	Proving termination of context-sensitive rewriting by transformation. Inf. Comput. Salvador Lucas
2006	J	`jnl`	Removing Redundant Arguments Automatically CoRR María Alpuente, Santiago Escobar, Salvador Lucas
2005	J	`jnl`	Operational termination of conditional term rewriting systems. Inf. Process. Lett. Salvador Lucas, Claude Marché, José Meseguer
2005	J	`jnl`	Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theor. Informatics Appl. Salvador Lucas
2005	—	`ed.`	Proceedings of the Fourth Spanish Conference on Programming and Computer Languages, PROLE 2004, Málaga, Spain, November 10-12, 2004 PROLE Salvador Lucas
2005	J	`jnl`	Reduction strategies in rewriting and programming. J. Symb. Comput. Bernhard Gramlich, Salvador Lucas
2005	—	`conf`	Rewriting-Based Navigation of Web Sites: Looking for Models and Logics. WWV Salvador Lucas
2005	—	`conf`	Rewriting-based navigation of Web sites. WWV Salvador Lucas
2005	J	`jnl`	Specialization of functional logic programs based on needed narrowing. Theory Pract. Log. Program. María Alpuente, Salvador Lucas, Michael Hanus, Germán Vidal
2005	B	`conf`	Termination of Fair Computations in Term Rewriting. LPAR Salvador Lucas, José Meseguer
2004	—	`conf`	New Evaluation Commands for Maude Within Full Maude. WRLA Francisco Durán, Santiago Escobar, Salvador Lucas
2004	—	`conf`	On-demand Evaluation for Maude. RULE@RDP Francisco Durán, Santiago Escobar, Salvador Lucas
2004	B	`conf`	Polynomials for Proving Termination of Context-Sensitive Rewriting. FoSSaCS Salvador Lucas
2004	—	`conf`	Preface. PROLE Salvador Lucas
2004	C	`conf`	Proving termination of membership equational programs. PEPM Francisco Durán, Salvador Lucas, José Meseguer, Claude Marché, Xavier Urbain
2004	J	`jnl`	Specialization of Functional Logic Programs Based on Needed Narrowing CoRR María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal
2004	—	`conf`	Strategies in Programming Languages Today. WRS Salvador Lucas
2004	J	`jnl`	Strong and NV-sequentiality of constructor systems. Inf. Process. Lett. Salvador Lucas
2004	—	`conf`	mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. RTA Salvador Lucas
2003	—	`ed.`	3rd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2003, Valencia, Spain, June 8, 2003, Final Proceedings WRS Bernhard Gramlich, Salvador Lucas
2003	—	`conf`	Abstract Correction of OBJ-like Programs. APPIA-GULP-PRODE María Alpuente, Demis Ballis, Santiago Escobar, Moreno Falaschi, Salvador Lucas
2003	—	`conf`	Abstract correction of first-order functional programs. WFLP María Alpuente, Demis Ballis, Santiago Escobar, Moreno Falaschi, Salvador Lucas
2003	—	`conf`	On-demand Evaluation by Program Transformation. RULE@RDP María Alpuente, Santiago Escobar, Salvador Lucas
2003	—	`conf`	OnDemandOBJ: A Laboratory for Strategy Annotations. RULE@RDP María Alpuente, Santiago Escobar, Salvador Lucas
2003	—	`conf`	Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. WRS Bernhard Gramlich, Salvador Lucas
2002	—	`ed.`	2nd International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2002, FLoC Satellite Event, Copenhagen, Denmark, July 21, 2002, Final Proceedings WRS Bernhard Gramlich, Salvador Lucas
2002	C	`conf`	Abstract Diagnosis of Functional Programs. LOPSTR María Alpuente, Marco Comini, Santiago Escobar, Moreno Falaschi, Salvador Lucas
2002	J	`jnl`	Context-Sensitive Rewriting Strategies. Inf. Comput. Salvador Lucas
2002	—	`conf`	Correct and Complete (Positive) Strategy Annotations for OBJ. WRLA María Alpuente, Santiago Escobar, Salvador Lucas
2002	—	`conf`	Demandness in Rewriting and Narrowing. WFLP Sergio Antoy, Salvador Lucas
2002	B	`conf`	Improving On-Demand Strategy Annotations. LPAR María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas
2002	C	`conf`	Modular termination of context-sensitive rewriting. PPDP Bernhard Gramlich, Salvador Lucas
2002	—	`conf`	Preface. WRS Bernhard Gramlich, Salvador Lucas
2002	A	`conf`	Recursive Path Orderings Can Be Context-Sensitive. CADE Cristina Borralleras, Salvador Lucas, Albert Rubio
2002	—	`conf`	Redundancy of Arguments Reduced to Induction. WFLP María Alpuente, Rachid Echahed, Santiago Escobar, Salvador Lucas
2002	—	`conf`	Removing Redundant Arguments of Functions. AMAST María Alpuente, Santiago Escobar, Salvador Lucas
2002	—	`conf`	Simple termination of context-sensitive rewriting. ACM SIGPLAN Workshop on Rule-Based Programming Bernhard Gramlich, Salvador Lucas
2002	—	`conf`	Termination of (Canonical) Context-Sensitive Rewriting. RTA Salvador Lucas
2001	—	`conf`	1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface. WRS Bernhard Gramlich, Salvador Lucas
2001	—	`ed.`	1st International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2001, Utrecht, The Netherlands, May 26, 2001 WRS Bernhard Gramlich, Salvador Lucas
2001	J	`jnl`	An Evaluation Semantics for Narrowing-Based Functional Logic Languages. J. Funct. Log. Program. Michael Hanus, Salvador Lucas
2001	—	`conf`	Lazy Rewriting and Context-Sensitive Rewriting. WFLP Salvador Lucas
2001	C	`conf`	Termination of On-Demand Rewriting and Termination of OBJ Programs. PPDP Salvador Lucas
2001	B	`conf`	Termination of Rewriting With Strategy Annotations. LPAR Salvador Lucas
2001	—	`conf`	Transfinite Rewriting Semantics for Term Rewriting Systems. RTA Salvador Lucas
2000	—	`conf`	Redundancy Analyses in Term Rewriting. WFLP María Alpuente, Santiago Escobar, Salvador Lucas
2000	—	`conf`	Redundant arguments in infinitary rewriting. WFLP Salvador Lucas
2000	—	`conf`	Strong and NV-sequentiality of constructor systems. WFLP Salvador Lucas
1999	—	`conf`	A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages. Fuji International Symposium on Functional and Logic Programming Michael Hanus, Salvador Lucas
1999	—	`conf`	An Incremental Needed Narrowing Calculus for Curry. APPIA-GULP-PRODE María Alpuente, Salvador Lucas, Santiago Escobar
1999	A	`conf`	Specialization of Inductively Sequential Functional Logic Programs. ICFP María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal
1999	B	`conf`	UPV-CURRY: An Incremental CURRY Interpreter. SOFSEM María Alpuente, Santiago Escobar, Salvador Lucas
1998	J	`jnl`	Context-sensitive Computations in Functional and Functional Logic Programs. J. Funct. Log. Program. Salvador Lucas
1998	J	`jnl`	Root-Neededness and Approximations of Neededness. Inf. Process. Lett. Salvador Lucas
1998	J	`jnl`	Strongly Sequential and Inductively Sequential Term Rewriting Systems. Inf. Process. Lett. Michael Hanus, Salvador Lucas, Aart Middeldorp
1997	—	`conf`	Computational Properties of Term Rewriting with Replacement Restrictions. APPIA-GULP-PRODE Salvador Lucas
1997	B	`conf`	Efficient Strong Sequentiality Using Replacement Restrictions. SOFSEM Salvador Lucas
1997	—	`conf`	Needed Reductions with Context-Sensitive Rewriting. ALP/HOA Salvador Lucas
1997	—	`conf`	Transformations for Efficient Evaluations in Functional Programming. PLILP Salvador Lucas
1996	—	`conf`	A Denotational Semantics for Needed Narrowing. APPIA-GULP-PRODE Michael Hanus, Salvador Lucas
1996	B	`conf`	A New Proposal of Concurrent Process Calculus. SOFSEM Salvador Lucas, Javier Oliver
1996	—	`conf`	Context-Sensitive Computations in Confluent Programs. PLILP Salvador Lucas
1996	A*	`conf`	Termination of Context-Sensitive Rewriting by Rewriting. ICALP Salvador Lucas
1995	—	`conf`	Computational Properties in Context-Sensitive Rewriting. GULP-PRODE Salvador Lucas
1995	B	`conf`	Fundamentals of Context=Sensitive Rewriting. SOFSEM Salvador Lucas
1994	—	`conf`	El lambda-calculo Etiquetado Paralelo (LCEP). GULP-PRODE (1) Salvador Lucas, Javier Oliver