103 search results - page 2 / 21 » Polygraphs for termination of left-linear term rewriting sys... |
109
click to vote
AMAST
2010
Springer
14 years 6 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 ...
160
click to vote
RTA
2011
Springer
14 years 2 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
JLP
2010
14 years 6 months ago
2010
RTA
2010
Springer
15 years 3 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
135
Voted
FROCOS
2011
Springer
13 years 11 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...