86 search results - page 1 / 18 » Proving Termination of Integer Term Rewriting |
159
Voted
RTA
2009
Springer
16 years 1 months ago
2009
Springer
202
Voted
AMAST
2010
Springer
15 years 2 months ago
2010
Springer
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...
174
click to vote
RTA
2007
Springer
16 years 1 months ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
173
Voted
CADE
2006
Springer
15 years 11 months ago
2006
Springer
165
Voted
JLP
2010
15 years 2 months ago
2010
