Salvador Lucas

Orcid: 0000-0001-9923-2108

Affiliations:
  • Polytechnic University of Valencia, Spain


According to our database1, Salvador Lucas authored at least 127 papers between 1994 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Local confluence of conditional and generalized term rewriting systems.
J. Log. Algebraic Methods Program., January, 2024

Confluence of Conditional Rewriting Modulo.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Proving Confluence in the Confluence Framework with CONFident.
CoRR, 2023

2022
Proving and disproving confluence of context-sensitive rewriting.
J. Log. Algebraic Methods Program., 2022

Confluence Framework: Proving Confluence with CONFident.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2022

2021
The origins of the halting problem.
J. Log. Algebraic Methods Program., 2021

Applications and extensions of context-sensitive rewriting.
J. Log. Algebraic Methods Program., 2021

Derivational Complexity and Context-Sensitive Rewriting.
J. Autom. Reason., 2021

Context-sensitive Rewriting.
ACM Comput. Surv., 2021

Confluence of Conditional Rewriting in Logic Form.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
The 2D Dependency Pair Framework for Conditional Rewrite Systems - Part II: Advanced Processors and Implementation Techniques.
J. Autom. Reason., 2020

Using Well-Founded Relations for Proving Operational Termination.
J. Autom. Reason., 2020

Proving Semantic Properties as First-Order Satisfiability (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

mu-term: Verify Termination Properties Automatically (System Description).
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

Automatically Proving and Disproving Feasibility Conditions.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
Proving semantic properties as first-order satisfiability.
Artif. Intell., 2019

Automatic Generation of Logical Models with AGES.
Proceedings of the Automated Deduction - CADE 27, 2019

2018
The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processors.
J. Comput. Syst. Sci., 2018

Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories.
J. Autom. Reason., 2018

Use of logical models for proving infeasibility in term rewriting.
Inf. Process. Lett., 2018

Proving Program Properties as First-Order Satisfiability.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2018

2017
Dependency pairs for proving termination properties of conditional term rewriting systems.
J. Log. Algebraic Methods Program., 2017

A Semantic Approach to the Analysis of Rewriting-Based Systems.
CoRR, 2017

Analysis of Rewriting-Based Systems as First-Order Theories.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2017

2016
Normal forms and normal theories in conditional rewriting.
J. Log. Algebraic Methods Program., 2016

Use of Logical Models for Proving Operational Termination in General Logics.
Proceedings of the Rewriting Logic and Its Applications - 11th International Workshop, 2016

2015
Completeness of context-sensitive rewriting.
Inf. Process. Lett., 2015

Synthesis of models for order-sorted first-order theories using linear algebra and constraint solving.
Proceedings of the Proceedings XV Jornadas sobre Programación y Lenguajes, 2015

Termination of canonical context-sensitive rewriting and productivity of rewrite systems.
Proceedings of the Proceedings XV Jornadas sobre Programación y Lenguajes, 2015

Localized Operational Termination in General Logics.
Proceedings of the Software, 2015

Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting.
Proceedings of the Logic, Rewriting, and Concurrency, 2015

2014
2D Dependency Pairs for Proving Operational Termination of CTRSs.
Proceedings of the Rewriting Logic and Its Applications - 10th International Workshop, 2014

Strong and Weak Operational Termination of Order-Sorted Rewrite Theories.
Proceedings of the Rewriting Logic and Its Applications - 10th International Workshop, 2014

Proving Operational Termination of Declarative Programs in General Logics.
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

Models for Logics and Conditional Constraints in Automated Proofs of Termination.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2014

Using Representation Theorems for Proving Polynomials Non-negative.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2014

2012
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints.
J. Autom. Reason., 2012

2010
On-demand strategy annotations revisited: An improved on-demand evaluation strategy.
Theor. Comput. Sci., 2010

Context-sensitive dependency pairs.
Inf. Comput., 2010

Proving Termination in the Context-Sensitive Dependency Pair Framework.
Proceedings of the Rewriting Logic and Its Applications - 8th International Workshop, 2010

A Dependency Pair Framework for <i>A</i> OR <i>C</i>-Termination.
Proceedings of the Rewriting Logic and Its Applications - 8th International Workshop, 2010

Proving Termination Properties with mu-term.
Proceedings of the Algebraic Methodology and Software Technology, 2010

From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals.
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2009
Automatic Proofs of Termination With Elementary Interpretations.
Proceedings of the Ninth Spanish Conference on Programming and Languages, 2009

Termination Modulo Combinations of Equational Theories.
Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009

Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic.
Proceedings of the Automated Deduction, 2009

2008
Proving operational termination of membership equational programs.
High. Order Symb. Comput., 2008

Termination of just/fair computations in term rewriting.
Inf. Comput., 2008

Operational Termination of Membership Equational Programs: the Order-Sorted Way.
Proceedings of the Seventh International Workshop on Rewriting Logic and its Applications, 2008

Web Services and Interoperability for the Maude Termination Tool.
Proceedings of the Eighth Spanish Conference on Programming and Computer Languages, 2008

Methods for Proving Termination of Rewriting-based Programming Languages by Transformation.
Proceedings of the Eighth Spanish Conference on Programming and Computer Languages, 2008

Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting.
Proceedings of the Eighth Spanish Conference on Programming and Computer Languages, 2008

Usable Rules for Context-Sensitive Rewrite Systems.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Order-sorted dependency pairs.
Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2008

Improving Context-Sensitive Dependency Pairs.
Proceedings of the Logic for Programming, 2008

MTT: The Maude Termination Tool (System Description).
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

Search Techniques for Rational Polynomial Orders.
Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007
Removing redundant arguments automatically.
Theory Pract. Log. Program., 2007

Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers.
Proceedings of the Seventh Spanish Conference on Programming and Computer Languages, 2007

Formal Verification of Websites.
Proceedings of the 3rd International Workshop on Automated Specification and Verification of Web Systems, 2007

Practical use of polynomials over the reals in proofs of termination.
Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2007

Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs.
Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

The Maude Formal Tool Environment.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
Proving termination of context-sensitive rewriting by transformation.
Inf. Comput., 2006

Improving the Context-sensitive Dependency Graph.
Proceedings of the Sixth Spanish Conference on Programming and Languages, 2006

Proving Termination of Context-Sensitive Rewriting with MU-TERM.
Proceedings of the Sixth Spanish Conference on Programming and Languages, 2006

On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting.
Appl. Algebra Eng. Commun. Comput., 2006

Generalizing Newman's Lemma for Left-Linear Rewrite Systems.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2005
Specialization of functional logic programs based on needed narrowing.
Theory Pract. Log. Program., 2005

Reduction strategies in rewriting and programming.
J. Symb. Comput., 2005

Polynomials over the reals in proofs of termination: from theory to practice.
RAIRO Theor. Informatics Appl., 2005

Operational termination of conditional term rewriting systems.
Inf. Process. Lett., 2005

Rewriting-Based Navigation of Web Sites: Looking for Models and Logics.
Proceedings of the International Workshop on Automated Specification and Verification of Web Sites, 2005

Rewriting-based navigation of Web sites.
Proceedings of the First International Workshop on Automated Specification and Verification of Web Sites (WWV 2005), 2005

Termination of Fair Computations in Term Rewriting.
Proceedings of the Logic for Programming, 2005

2004
Strong and NV-sequentiality of constructor systems.
Inf. Process. Lett., 2004

Preface.
Proceedings of the Fourth Spanish Conference on Programming and Computer Languages, 2004

Strategies in Programming Languages Today.
Proceedings of the 4th International Workshop on Reduction Strategies in Rewriting and Programming, 2004

On-demand Evaluation for Maude.
Proceedings of the 5th International Workshop on Rule-Based Programming, 2004

New Evaluation Commands for Maude Within Full Maude.
Proceedings of the Fifth International Workshop on Rewriting Logic and Its Applications, 2004

mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting.
Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

Proving termination of membership equational programs.
Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2004

Polynomials for Proving Termination of Context-Sensitive Rewriting.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings.
Proceedings of the 3rd International Workshop on Reduction Strategies in Rewriting and Programming, 2003

On-demand Evaluation by Program Transformation.
Proceedings of the 4th International Workshop on Rule-Based Programming, 2003

OnDemandOBJ: A Laboratory for Strategy Annotations.
Proceedings of the 4th International Workshop on Rule-Based Programming, 2003

Abstract correction of first-order functional programs.
Proceedings of the 12th International Workshop on Functional and Constraint Logic Programming, 2003

Abstract Correction of OBJ-like Programs.
Proceedings of the 2003 Joint Conference on Declarative Programming, 2003

2002
Context-Sensitive Rewriting Strategies.
Inf. Comput., 2002

Preface.
Proceedings of the 2nd International Workshop on Reduction Strategies in Rewriting and Programming, 2002

Demandness in Rewriting and Narrowing.
Proceedings of the 11th International Workshop on Functional and (Constraint) Logic Programming, 2002

Correct and Complete (Positive) Strategy Annotations for OBJ.
Proceedings of the Fourth International Workshop on Rewriting logic and Its Applications, 2002

Redundancy of Arguments Reduced to Induction.
Proceedings of the 11th International Workshop on Functional and (Constraint) Logic Programming, 2002

Simple termination of context-sensitive rewriting.
Proceedings of the 2002 ACM SIGPLAN Workshop on Rule-Based Programming, 2002

Termination of (Canonical) Context-Sensitive Rewriting.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

Modular termination of context-sensitive rewriting.
Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Improving On-Demand Strategy Annotations.
Proceedings of the Logic for Programming, 2002

Abstract Diagnosis of Functional Programs.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

Recursive Path Orderings Can Be Context-Sensitive.
Proceedings of the Automated Deduction, 2002

Removing Redundant Arguments of Functions.
Proceedings of the Algebraic Methodology and Software Technology, 2002

2001
1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface.
Proceedings of the 1st International Workshop on Reduction Strategies in Rewriting and Programming, 2001

An Evaluation Semantics for Narrowing-Based Functional Logic Languages.
J. Funct. Log. Program., 2001

Lazy Rewriting and Context-Sensitive Rewriting.
Proceedings of the International Workshop on Functional and (Constraint) Logic Programming, 2001

Transfinite Rewriting Semantics for Term Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Termination of On-Demand Rewriting and Termination of OBJ Programs.
Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, 2001

Termination of Rewriting With Strategy Annotations.
Proceedings of the Logic for Programming, 2001

2000
Redundant arguments in infinitary rewriting.
Proceedings of the 9th International Workshop on Functional and Logic Programming, 2000

Redundancy Analyses in Term Rewriting.
Proceedings of the 9th International Workshop on Functional and Logic Programming, 2000

1999
UPV-CURRY: An Incremental CURRY Interpreter.
Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

Specialization of Inductively Sequential Functional Logic Programs.
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999

A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages.
Proceedings of the Functional and Logic Programming, 4th Fuji International Symposium, 1999

An Incremental Needed Narrowing Calculus for Curry.
Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998
Context-sensitive Computations in Functional and Functional Logic Programs.
J. Funct. Log. Program., 1998

Root-Neededness and Approximations of Neededness.
Inf. Process. Lett., 1998

Strongly Sequential and Inductively Sequential Term Rewriting Systems.
Inf. Process. Lett., 1998

1997
Efficient Strong Sequentiality Using Replacement Restrictions.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Transformations for Efficient Evaluations in Functional Programming.
Proceedings of the Programming Languages: Implementations, 1997

Needed Reductions with Context-Sensitive Rewriting.
Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

Computational Properties of Term Rewriting with Replacement Restrictions.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996
A New Proposal of Concurrent Process Calculus.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

Context-Sensitive Computations in Confluent Programs.
Proceedings of the Programming Languages: Implementations, 1996

Termination of Context-Sensitive Rewriting by Rewriting.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

A Denotational Semantics for Needed Narrowing.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995
Fundamentals of Context=Sensitive Rewriting.
Proceedings of the SOFSEM '95, 22nd Seminar on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 23, 1995

Computational Properties in Context-Sensitive Rewriting.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995

1994
El lambda-calculo Etiquetado Paralelo (LCEP).
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994


  Loading...