28 search results - page 2 / 6 » Bytecode Rewriting in Tom |
RTA
2010
Springer
14 years 1 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...
CC
2000
Springer
13 years 9 months ago
2000
Springer
The performance of a Java Virtual Machine (JVM) interpreter running on a very long instruction word (VLIW) processor can be improved by means of pipelining. While one bytecode is i...
RTA
2011
Springer
13 years 13 days 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...
AGTIVE
2007
Springer
14 years 3 months ago
2007
Springer
BIRTHDAY
2010
Springer
13 years 7 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...