Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Journal of Symbolic Computation
Completeness of combinations of constructor systems
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
On the modularity of termination of term rewriting systems
Theoretical Computer Science
Modular properties of composable term rewriting systems
Journal of Symbolic Computation
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Proceedings of the 9th International Conference on Rewriting Techniques and Applications
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Argument Filtering Transformation
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Modularity of Termination Using Dependency pairs
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Termination of Associative-Commutative Rewriting by Dependency Pairs
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
Hierarchical termination revisited
Information Processing Letters
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
On proving C ε-termination of rewriting by size-change termination
Information Processing Letters
Elimination Transformations for Associative---Commutative Rewriting Systems
Journal of Automated Reasoning
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
On proving C E-termination of rewriting by size-change termination
Information Processing Letters
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
| Hi-index | 0.00 |
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules which allow us to perform termination proofs incrementally. Important results can be expressed in that new framework (regarding C驴-termination for instance), and with help of 驴 extendable orderings, we give effective new incremental methods for proving termination particularly suited for automation.