98 search results - page 7 / 20 » Matrix Interpretations for Proving Termination of Term Rewri... |
RTA
2005
Springer
14 years 25 days ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
AAECC
2005
Springer
13 years 7 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
CADE
2001
Springer
14 years 7 months ago
2001
Springer
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 whic...
ENTCS
2008
13 years 7 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
FROCOS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...