Proving Termination of Context-Sensitive Rewriting with MU-TERM

Authors:
Beatriz Alarcón;Raúl Gutiérrez;José Iborra;Salvador Lucas
Affiliations:
Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain;Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 17
Cited 14

Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Advanced topics in term rewriting

Advanced topics in term rewriting
Simple termination of context-sensitive rewriting

Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Modular termination of context-sensitive rewriting

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Context-sensitive rewriting strategies

Information and Computation
Termination of Context-Sensitive Rewriting

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Recursive Path Orderings Can Be Context-Sensitive

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Transformation techniques for context-sensitive rewrite systems

Journal of Functional Programming
Proving termination of membership equational programs

Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Termination of String Rewriting Proved Automatically

Journal of Automated Reasoning
On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting

Applicable Algebra in Engineering, Communication and Computing
Mechanically Proving Termination Using Polynomial Interpretations

Journal of Automated Reasoning
Proving termination of context-sensitive rewriting by transformation

Information and Computation
Context-sensitive dependency pairs

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Tyrolean termination tool

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Solving partial order constraints for LPO termination

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Proving termination of context-sensitive rewriting by transformation

Information and Computation
Improving the Context-sensitive Dependency Graph

Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of just/fair computations in term rewriting

Information and Computation
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers

Electronic Notes in Theoretical Computer Science (ENTCS)
Usable Rules for Context-Sensitive Rewrite Systems

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Improving Context-Sensitive Dependency Pairs

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Termination of Narrowing Using Dependency Pairs

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Operational Termination of Membership Equational Programs: the Order-Sorted Way

Electronic Notes in Theoretical Computer Science (ENTCS)
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)
Context-sensitive dependency pairs

Information and Computation
Proving termination in the context-sensitive dependency pair framework

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A dependency pair framework for A∨C-termination

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Proving termination properties with MU-TERM

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Context-sensitive dependency pairs

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem with several applications in the fields of term rewriting and programming languages. Several methods have been developed for proving termination of CSR. The new version of MU-TERM which we present here implements all currently known techniques. Furthermore, we show how to combine them to furnish MU-TERM with an expert which is able to automatically perform the termination proofs. Finally, we provide a first experimental evaluation of the tool.