59 search results - page 2 / 12 » Termination of Fair Computations in Term Rewriting |
RTA
1991
Springer
13 years 8 months ago
1991
Springer
Narrowing provides a complete procedure to solve equations modulo confluent and terminating rewriting systems. But it seldom terminates. This paper presents a method to improve th...
RTA
2011
Springer
12 years 8 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...
RTA
2010
Springer
13 years 8 months ago
2010
Springer
We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous t...
RTA
2009
Springer
13 years 11 months ago
2009
Springer
RTA
2007
Springer
13 years 11 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. ...