86 search results - page 1 / 18 » Proving Termination of Integer Term Rewriting |
61
Voted
RTA
2009
Springer
15 years 3 months ago
2009
Springer
AMAST
2010
Springer
14 years 4 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
15 years 3 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
15 years 1 months ago
2006
Springer
JLP
2010
14 years 4 months ago
2010
