18 search results - page 3 / 4 » A Term Rewriting Approach to the Automated Termination Analy... |
RTA
2009
Springer
14 years 9 days ago
2009
Springer
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
TACAS
2010
Springer
14 years 23 days ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
LPAR
2004
Springer
13 years 11 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
ACSC
2004
IEEE
13 years 9 months ago
2004
IEEE
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...
LOPSTR
2009
Springer
14 years 10 days ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...