Journal of Symbolic Computation
Modularity of simple termination of term rewriting systems with shared constructors
Theoretical Computer Science
Simulation of Turing machines by a regular rewrite rule
Theoretical Computer Science
On the modularity of termination of term rewriting systems
Theoretical Computer Science
Modular proofs for completeness of hierarchical term rewriting systems
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Term rewriting and all that
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Advanced topics in term rewriting
Advanced topics in term rewriting
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 by Rewriting
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Termination of (Canonical) Context-Sensitive Rewriting
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
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
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
Termination of on-demand rewriting and termination of OBJ programs
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Simplification Orderings: History Of Results
Fundamenta Informaticae
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Relaxing monotonicity for innermost termination
Information Processing Letters
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Tyrolean termination tool: Techniques and features
Information and Computation
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Improving Context-Sensitive Dependency Pairs
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Relaxing monotonicity for innermost termination
Information Processing Letters
Innermost termination of context-sensitive rewriting
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Context-sensitive dependency pairs
Information and Computation
Context-sensitive dependency pairs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Modularity in term rewriting revisited
Theoretical Computer Science
Hi-index | 0.00 |
Simple termination is the (often indirect) basis of most existing automatic techniques for proving termination of rule-based programs (e.g., Knuth-Bendix, polynomial, or recursive path orderings, but also DP-simple termination, etc.). An interesting framework for such programs is context-sensitive rewriting (CSR) that provides a bridge between the abstract world of general rewriting and the (more) applied setting of declarative specification and programming languages (e.g., OBJ*, CafeOBJ, ELAN, and Maude). In these languages, certain replacement restrictions can be specified in programs by the so-called strategy annotations. They may significantly improve the computational properties of programs, especially regarding their termination behaviour. Context-sensitive rewriting techniques (in particular, the methods for proving termination of CSR) have been proved useful for analyzing the properties of these programs. This entails the need to provide implementable methods for proving termination of CSR. Simplification orderings (corresponding to the notion of simple termination) which are well-known in term rewriting (and have nice properties) are, then, natural candidates for such an attempt. In this paper we introduce and investigate a corresponding notion of simple termination of CSR. We prove that our notion actually provides a unifying framework for proving termination of CSR by using standard simplification orderings via the existing (transformational) methods, and also covers CSRPO, a very recent proposal that extends the recursive path ordering (RPO) (a well-known simplification ordering) to context-sensitive terms. We also introduce polynomial orderings for dealing with (simple) termination of CSR. Finally, we also give criteria for the modularity of simple termination, for the case of disjoint unions as well as for constructor-sharing rewrite systems.