Salvador Lucas

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 28

Top Venues

J. Log. Algebraic Methods Program.

LOPSTR

J. Autom. Reason.

CoRR

Publications

Salvador Lucas
Local confluence of conditional and generalized term rewriting systems. J. Log. Algebraic Methods Program. 136 (2024)
Salvador Lucas
Termination of Generalized Term Rewriting Systems. FSCD (2024)
Salvador Lucas
Confluence of Conditional Rewriting Modulo. CSL (2024)
Raúl Gutiérrez, Salvador Lucas, Miguel Vítores
Proving Confluence in the Confluence Framework with CONFident. CoRR (2023)
Salvador Lucas, Miguel Vítores, Raúl Gutiérrez
Proving and disproving confluence of context-sensitive rewriting. J. Log. Algebraic Methods Program. 126 (2022)
Raúl Gutiérrez, Miguel Vítores, Salvador Lucas
Confluence Framework: Proving Confluence with CONFident. LOPSTR (2022)
Salvador Lucas
The origins of the halting problem. J. Log. Algebraic Methods Program. 121 (2021)
Raúl Gutiérrez, Salvador Lucas, Miguel Vítores
Confluence of Conditional Rewriting in Logic Form. FSTTCS (2021)
Salvador Lucas
Applications and extensions of context-sensitive rewriting. J. Log. Algebraic Methods Program. 121 (2021)
Salvador Lucas
Derivational Complexity and Context-Sensitive Rewriting. J. Autom. Reason. 65 (8) (2021)
Raúl Gutiérrez, Salvador Lucas
Automatically Proving and Disproving Feasibility Conditions. IJCAR (2) (2020)
Salvador Lucas, José Meseguer, Raúl Gutiérrez
The 2D Dependency Pair Framework for Conditional Rewrite Systems - Part II: Advanced Processors and Implementation Techniques. J. Autom. Reason. 64 (8) (2020)
Salvador Lucas
Context-sensitive Rewriting. ACM Comput. Surv. 53 (4) (2020)
Raúl Gutiérrez, Salvador Lucas
mu-term: Verify Termination Properties Automatically (System Description). IJCAR (2) (2020)
Salvador Lucas
Using Well-Founded Relations for Proving Operational Termination. J. Autom. Reason. 64 (2) (2020)
Salvador Lucas
Proving Semantic Properties as First-Order Satisfiability (Extended Abstract). IJCAI (2020)
Raúl Gutiérrez, Salvador Lucas
Automatic Generation of Logical Models with AGES. CADE (2019)
Salvador Lucas
Proving semantic properties as first-order satisfiability. Artif. Intell. 277 (2019)
Salvador Lucas
Proving Program Properties as First-Order Satisfiability. LOPSTR (2018)
Salvador Lucas, Raúl Gutiérrez
Use of logical models for proving infeasibility in term rewriting. Inf. Process. Lett. 136 (2018)
Salvador Lucas, Raúl Gutiérrez
Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories. J. Autom. Reason. 60 (4) (2018)
Salvador Lucas, José Meseguer, Raúl Gutiérrez
The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processors. J. Comput. Syst. Sci. 96 (2018)
Salvador Lucas
Proving Program Properties as First-Order Satisfiability. CoRR (2018)
Salvador Lucas
A Semantic Approach to the Analysis of Rewriting-Based Systems. CoRR (2017)
Salvador Lucas
Analysis of Rewriting-Based Systems as First-Order Theories. LOPSTR (2017)
Salvador Lucas, José Meseguer
Dependency pairs for proving termination properties of conditional term rewriting systems. J. Log. Algebraic Methods Program. 86 (1) (2017)
Salvador Lucas, José Meseguer
Normal forms and normal theories in conditional rewriting. J. Log. Algebraic Methods Program. 85 (1) (2016)
Salvador Lucas
Use of Logical Models for Proving Operational Termination in General Logics. WRLA (2016)
Salvador Lucas
Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving. PROLE (2015)
Salvador Lucas
Completeness of context-sensitive rewriting. Inf. Process. Lett. 115 (2) (2015)
Salvador Lucas
Termination of canonical context-sensitive rewriting and productivity of rewrite systems. PROLE (2015)
Salvador Lucas, José Meseguer
Localized Operational Termination in General Logics. Software, Services, and Systems (2015)
Raúl Gutiérrez, Salvador Lucas
Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting. Logic, Rewriting, and Concurrency (2015)
Salvador Lucas, José Meseguer
Proving Operational Termination of Declarative Programs in General Logics. PPDP (2014)
Salvador Lucas
Using Representation Theorems for Proving Polynomials Non-negative. AISC (2014)
Salvador Lucas, José Meseguer
Models for Logics and Conditional Constraints in Automated Proofs of Termination. AISC (2014)
Salvador Lucas, José Meseguer, Raúl Gutiérrez
Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems. LOPSTR (2014)
Salvador Lucas, José Meseguer
Strong and Weak Operational Termination of Order-Sorted Rewrite Theories. WRLA (2014)
Salvador Lucas, José Meseguer
2D Dependency Pairs for Proving Operational Termination of CTRSs. WRLA (2014)
Cristina Borralleras, Salvador Lucas, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints. J. Autom. Reason. 48 (1) (2012)
Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
Context-sensitive dependency pairs. Inf. Comput. 208 (8) (2010)
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) (2010)
Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas, Rafael Navarro-Marset
Proving Termination Properties with mu-term. AMAST (2010)
Salvador Lucas
From matrix interpretations over the rationals to matrix interpretations over the naturals CoRR (2010)
Salvador Lucas
From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals. AISC/MKM/Calculemus (2010)
Beatriz Alarcón, Salvador Lucas, José Meseguer
-Termination. WRLA (2010)
Raúl Gutiérrez, Salvador Lucas
Proving Termination in the Context-Sensitive Dependency Pair Framework. WRLA (2010)
Francisco Durán, Salvador Lucas, José Meseguer
Termination Modulo Combinations of Equational Theories. FroCoS (2009)
Beatriz Alarcón, Salvador Lucas
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting. Electron. Notes Theor. Comput. Sci. 248 (2009)
Francisco Durán, Salvador Lucas, José Meseguer
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation. Electron. Notes Theor. Comput. Sci. 248 (2009)
Salvador Lucas
Automatic Proofs of Termination With Elementary Interpretations. Electron. Notes Theor. Comput. Sci. 258 (1) (2009)
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)
Francisco Durán, Salvador Lucas, José Meseguer, Francisco Gutiérrez
Web Services and Interoperability for the Maude Termination Tool. Electron. Notes Theor. Comput. Sci. 248 (2009)
Salvador Lucas, Rafael Navarro-Marset
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers. Electron. Notes Theor. Comput. Sci. 206 (2008)
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)
Raúl Gutiérrez, Salvador Lucas, Xavier Urbain
Usable Rules for Context-Sensitive Rewrite Systems. RTA (2008)
Francisco Durán, Salvador Lucas, José Meseguer
MTT: The Maude Termination Tool (System Description). IJCAR (2008)
Salvador Lucas, José Meseguer
Operational Termination of Membership Equational Programs: the Order-Sorted Way. WRLA (2008)
Salvador Lucas, José Meseguer
Order-sorted dependency pairs. PPDP (2008)
Salvador Lucas, José Meseguer
Termination of just/fair computations in term rewriting. Inf. Comput. 206 (5) (2008)
Francisco Durán, Salvador Lucas, Claude Marché, José Meseguer, Xavier Urbain
Proving operational termination of membership equational programs. High. Order Symb. Comput. 21 (1-2) (2008)
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)
Sonia Flores, Salvador Lucas, Alicia Villanueva
Formal Verification of Websites. Electron. Notes Theor. Comput. Sci. 200 (3) (2008)
Manuel Clavel, Francisco Durán, Joe Hendrix, Salvador Lucas, José Meseguer, Peter Csaba Ölveczky
The Maude Formal Tool Environment. CALCO (2007)
Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
Improving the Context-sensitive Dependency Graph. Electron. Notes Theor. Comput. Sci. 188 (2007)
Salvador Lucas
Practical use of polynomials over the reals in proofs of termination. PPDP (2007)
Beatriz Alarcón, Raúl Gutiérrez, José Iborra, Salvador Lucas
Proving Termination of Context-Sensitive Rewriting with MU-TERM. Electron. Notes Theor. Comput. Sci. 188 (2007)
María Alpuente, Santiago Escobar, Salvador Lucas
Removing redundant arguments automatically. Theory Pract. Log. Program. 7 (1-2) (2007)
Beatriz Alarcón, Salvador Lucas
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs. FroCoS (2007)
Salvador Lucas
Rewriting-Based Navigation of Web Sites: Looking for Models and Logics. Electron. Notes Theor. Comput. Sci. 157 (2) (2006)
María Alpuente, Santiago Escobar, Salvador Lucas
Removing Redundant Arguments Automatically CoRR (2006)
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) (2006)
Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
Context-Sensitive Dependency Pairs. FSTTCS (2006)
Bernhard Gramlich, Salvador Lucas
Generalizing Newman's Lemma for Left-Linear Rewrite Systems. RTA (2006)
Salvador Lucas
Proving termination of context-sensitive rewriting by transformation. Inf. Comput. 204 (12) (2006)
María Alpuente, Salvador Lucas, Michael Hanus, Germán Vidal
Specialization of functional logic programs based on needed narrowing. Theory Pract. Log. Program. 5 (3) (2005)
Salvador Lucas
Rewriting-based navigation of Web sites. WWV (2005)
Salvador Lucas
Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theor. Informatics Appl. 39 (3) (2005)
Salvador Lucas
Preface. Electron. Notes Theor. Comput. Sci. 137 (1) (2005)
Francisco Durán, Santiago Escobar, Salvador Lucas
On-demand Evaluation for Maude. Electron. Notes Theor. Comput. Sci. 124 (1) (2005)
Salvador Lucas, José Meseguer
Termination of Fair Computations in Term Rewriting. LPAR (2005)
Salvador Lucas
Strategies in Programming Languages Today. Electron. Notes Theor. Comput. Sci. 124 (2) (2005)
Bernhard Gramlich, Salvador Lucas
Reduction strategies in rewriting and programming. J. Symb. Comput. 40 (1) (2005)
Salvador Lucas, Claude Marché, José Meseguer
Operational termination of conditional term rewriting systems. Inf. Process. Lett. 95 (4) (2005)
Salvador Lucas
Strong and NV-sequentiality of constructor systems. Inf. Process. Lett. 89 (4) (2004)
Francisco Durán, Salvador Lucas, José Meseguer, Claude Marché, Xavier Urbain
Proving termination of membership equational programs. PEPM (2004)
Francisco Durán, Santiago Escobar, Salvador Lucas
New Evaluation Commands for Maude Within Full Maude. WRLA (2004)
María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal
Specialization of Functional Logic Programs Based on Needed Narrowing CoRR (2004)
Salvador Lucas
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. RTA (2004)
Salvador Lucas
Polynomials for Proving Termination of Context-Sensitive Rewriting. FoSSaCS (2004)
María Alpuente, Demis Ballis, Santiago Escobar, Moreno Falaschi, Salvador Lucas
Abstract Correction of OBJ-like Programs. APPIA-GULP-PRODE (2003)
María Alpuente, Demis Ballis, Santiago Escobar, Moreno Falaschi, Salvador Lucas
Abstract correction of first-order functional programs. Electron. Notes Theor. Comput. Sci. 86 (3) (2003)
Bernhard Gramlich, Salvador Lucas
Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. Electron. Notes Theor. Comput. Sci. 86 (4) (2003)
María Alpuente, Santiago Escobar, Salvador Lucas
OnDemandOBJ: A Laboratory for Strategy Annotations. Electron. Notes Theor. Comput. Sci. 86 (2) (2003)
María Alpuente, Santiago Escobar, Salvador Lucas
On-demand Evaluation by Program Transformation. Electron. Notes Theor. Comput. Sci. 86 (2) (2003)
María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas
Improving On-Demand Strategy Annotations. LPAR (2002)
María Alpuente, Santiago Escobar, Salvador Lucas
Removing Redundant Arguments of Functions. AMAST (2002)
Salvador Lucas
Termination of (Canonical) Context-Sensitive Rewriting. RTA (2002)
Salvador Lucas
Lazy Rewriting and Context-Sensitive Rewriting. Electron. Notes Theor. Comput. Sci. 64 (2002)
Sergio Antoy, Salvador Lucas
Demandness in Rewriting and Narrowing. Electron. Notes Theor. Comput. Sci. 76 (2002)

Salvador Lucas.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Salvador Lucas