On the Church-Rosser property for the direct sum of term rewriting systems
Journal of the ACM (JACM)
Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
On termination of the direct sum of term-rewriting systems
Information Processing Letters
A sufficient condition for the termination of the direct sum of term rewriting systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
Modularity of simple termination of term rewriting systems with shared constructors
Theoretical Computer Science
Completeness of combinations of constructor systems
Journal of Symbolic Computation
Modularity of confluence: a simplified proof
Information Processing Letters
Modular properties of conditional term rewriting systems
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Completeness of combinations of conditional constructor systems
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
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
Modularity in noncopying term rewriting
Theoretical Computer Science
Modular termination of r-consistent and left-linear term rewriting systems
Theoretical Computer Science
Modular properties of composable term rewriting systems
Journal of Symbolic Computation
Termination for direct sums of left-linear complete term rewriting systems
Journal of the ACM (JACM)
Term rewriting and all that
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Simple termination of context-sensitive rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Context-sensitive rewriting strategies
Information and Computation
Improving On-Demand Strategy Annotations
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Operational Termination of Membership Equational Programs: the Order-Sorted Way
Electronic Notes in Theoretical Computer Science (ENTCS)
On-demand strategy annotations revisited: An improved on-demand evaluation strategy
Theoretical Computer Science
Innermost termination of context-sensitive rewriting
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Proving termination properties with MU-TERM
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Generalizing newman's lemma for left-linear rewrite systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Modularity in term rewriting revisited
Theoretical Computer Science
Hi-index | 0.00 |
Context-sensitive rewriting (CSR) has recently emerged as an interesting and flexible paradigm that provides a bridge between the abstract world of general rewriting and the (more) applied setting of declarative specification and programming languages such as OBJ*, CafeOBJ, ELAN, and Maude. A natural approach to study properties of programs written in these languages is to model them as context-sensitive rewriting systems. Here we are especially interested in proving termination of such systems, and thereby providing methods to establish termination of e.g. OBJ* programs. For proving termination of context-sensitive re-writing, there exist a few transformation methods, that reduce the problem to termination of a transformed ordinary term rewriting system (TRS). These transformations, however, have some serious drawbacks. In particular, most of them do not seem to support a modular analysis of the termination problem. In this paper we will show that a substantial part of the well-known theory of modular term rewriting can be extended to CSR, via a thorough analysis of the additional complications arising from context-sensitivity. More precisely, we will mainly concentrate on termination (properties). The obtained modularity results correspond nicely to the fact that in the above languages the modular design of programs and specifications is explicitly promoted, since it can now also be complemented by modular analysis techniques.