Proof of termination of the rewriting system SUBST on CCL
Theoretical Computer Science
Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Journal of Symbolic Computation
Simplifying conditional term rewriting systems: Unification, termination and confluence
Journal of Symbolic Computation
Using unavoidable set of trees to generalize Kruskal's theorem
Journal of Symbolic Computation
Well rewrite orderings and well quasi-orderings
Journal of Symbolic Computation
Termination of term rewriting: interpretation and type elimination
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
Strong Normalization of Substitutions
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Embedding with Patterns and Associated Recursive Path Ordering
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Extensions and Comparison of Simplification Orderings
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Termination of Order-sorted Rewriting
Proceedings of the Third International Conference on Algebraic and Logic Programming
Termination of Term Rewriting by Interpretation
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Basic process algebra with iteration: completeness of its equational axioms.
Basic process algebra with iteration: completeness of its equational axioms.
Light analysis of complex systems
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Proof-term synthesis on dependent-type systems via explicit substitutions
Theoretical Computer Science
Dependent Types for Program Termination Verification
Higher-Order and Symbolic Computation
From Higher-Order to First-Order Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Equational Termination by Semantic Labelling
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Right-linear half-monadic term rewrite systems
Theoretical Computer Science
Dependent types and explicit substitutions: a meta-theoretical development
Mathematical Structures in Computer Science
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Termination of String Rewriting Proved Automatically
Journal of Automated Reasoning
Normalisation for higher-order calculi with explicit substitutions
Theoretical Computer Science - Foundations of software science and computation structures
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features
Information and Computation
Higher-order semantic labelling for inductive datatype systems
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Innermost Termination of Rewrite Systems by Labeling
Electronic Notes in Theoretical Computer Science (ENTCS)
Predictive Labeling with Dependency Pairs Using SAT
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
From Outermost Termination to Innermost Termination
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Analysis of Rewrite-Based Access Control Policies
Electronic Notes in Theoretical Computer Science (ENTCS)
The Derivational Complexity Induced by the Dependency Pair Method
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
From Outermost to Context-Sensitive Rewriting
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Transforming SAT into Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination of simply typed term rewriting by translation and labelling
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination by quasi-periodic interpretations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
On the relation between sized-types based termination and semantic labelling
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
POP and semantic labeling using SAT
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Signature extensions preserve termination: an alternative proof via dependency pairs
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Termination of Isabelle functions via termination of rewriting
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Harnessing first order termination provers using higher order dependency pairs
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Derivational complexity of knuth-bendix orders revisited
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Automation of recursive path ordering for infinite labelled rewrite systems
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving liveness with fairness using rewriting
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
TPA: termination proved automatically
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Reducing right-hand sides for termination
Processes, Terms and Cycles
Semantic labelling for proving termination of combinatory reduction systems
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Bounded programs: a new decidable class of logic programs with function symbols
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
A new kind of transformation of term rewriting systems (TRS) is proposed, depending on a choice for a model for the TRS. The labelled TRS is obtained from the original one by labelling operation symbols, possibly creating extra copies of some rules. This construction has the remarkable property that the labelled TRS is terminating if and only if the original TRS is terminating. Although the labelled version has more operation symbols and may have more rules (sometimes infinitely many), termination is often easier to prove for the labelled TRS than for the original one. This provides a new technique for proving termination, making classical techniques like path orders and polynomial interpretations applicable even for non-simplifying TRS’s. The requirement of having a model can slightly be weakened, yielding a remarkably simple termination proof of the system SUBST of [11] describing explicit substitution in λ-calculus.