Summary: Aachen
Department of Computer Science
Technical Report
Termination Graphs for Java
Bytecode
Marc Brockschmidt, Carsten Otto, Christian von Essen,
J¨urgen Giesl
ISSN 0935­3232 · Aachener Informatik-Berichte · AIB-2010-15
RWTH Aachen · Department of Computer Science · September 2010 (revised)
1
The publications of the Department of Computer Science of RWTH Aachen
University are in general accessible through the World Wide Web.
http://aib.informatik.rwth-aachen.de/
2
Termination Graphs for Java Bytecode
M. Brockschmidt, C. Otto, C. von Essen, and J. Giesl
LuFG Informatik 2, RWTH Aachen University, Germany
Abstract. To prove termination of Java Bytecode (JBC) automatically,
we transform JBC to finite termination graphs which represent all pos-
sible runs of the program. Afterwards, the graph can be translated into

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

Collections: Computer Technologies and Information Sciences