203 search results - page 18 / 41 » Datatype-Generic Termination Proofs |
122
click to vote
RTA
2004
Springer
15 years 7 months ago
2004
Springer
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
138
click to vote
RTA
2005
Springer
15 years 7 months 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...
113
click to vote
LOGCOM
2007
15 years 1 months ago
2007
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
121
click to vote
AAECC
2005
Springer
15 years 1 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...
116
Voted
ENTCS
2008
15 years 2 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...