POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Context-sensitive rewriting strategies
Information and Computation
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
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Relaxing monotonicity for innermost termination
Information Processing Letters
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Improving the Context-sensitive Dependency Graph
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
Innermost termination of context-sensitive rewriting
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Context-sensitive dependency pairs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Orderings for innermost termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
Computational systems based on reducing expressions usually have a predefined reduction strategy to break down the nondeterminism which is inherent to reduction relations. The innermost strategy corresponds to call by value or eager computation, that is, the computational mechanism of several programming languages like Maude, OBJ, etc. where the arguments of a function call are always evaluated before calling the function. This strategy usually fails to terminate when nonterminating computations are possible in the programs and many eager programming languages also admit the explicit specification of a particular class of strategy annotations to (try to) avoid them. Context-Sensitive Rewriting provides an abstract model to describe and analyze the operational behavior of such programs. This paper aims at contributing to the development of appropriate techniques and tools for the verification of program termination in the aforementioned programming languages, so we focus on termination of innermost (context-sensitive) rewriting. We adapt the notion of usable argument introduced by Fernandez to prove innermost termination by proving termination of context-sensitive rewriting. Thanks to our recent developments for proving termination of (innermost) context-sensitive rewriting using dependency pairs, now we can also relax monotonicity requirements for proving innermost termination of (context-sensitive) rewriting. We have implemented these new improvements in the termination tool mu-term and evaluated the results with some benchmarks.