Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features
Information and Computation
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
Proving Termination by Bounded Increase
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)
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Automated termination analysis for Haskell: from term rewriting to programming languages
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
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
Automated termination proofs for haskell by term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important technique for program verification. To capture the evaluation mechanism of a programming language one has to take care of the evaluation strategy, where we focus on the outermost strategy. As there are only few techniques available to analyze outermost termination of TRSs directly, we introduce a new transformation such that a TRS is outermost terminating iff the transformed TRS is innermost terminating. In this way all of the several techniques that have been developed to investigate innermost termination become applicable to analyze outermost termination, too. We have implemented the transformation and successfully evaluated it on a large collection of TRSs.