86 search results - page 1 / 18 » Proving Termination of Integer Term Rewriting |
RTA
2009
Springer
13 years 11 months ago
2009
Springer
AMAST
2010
Springer
12 years 11 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 ...
RTA
2007
Springer
13 years 10 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. ...
CADE
2006
Springer
13 years 8 months ago
2006
Springer
JLP
2010
12 years 11 months ago
2010
