Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Termination Graphs for Java Bytecode M. Brockschmidt, C. Otto, C. von Essen, and J. Giesl

Summary: 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
"simple" formalisms like term rewriting and existing tools can be used
to prove termination of the resulting term rewrite system (TRS). In this
paper we show that termination graphs indeed capture the semantics of
JBC correctly. Hence, termination of the TRS resulting from the termi-
nation graph implies termination of the original JBC program.
1 Introduction
Termination is an important property of programs. Therefore, techniques to an-
alyze termination automatically have been studied for decades [7, 8, 20]. While
most work focused on term rewrite systems or declarative programming lan-
guages, recently there have also been many results on termination of imperative
programs (e.g., [2, 4, 5]). However, these are "stand-alone" methods which do not
allow to re-use the many existing termination techniques and tools for TRSs and
declarative languages. Therefore, in [15] we presented the first rewriting-based
approach for proving termination of a real imperative object-oriented language,


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


Collections: Computer Technologies and Information Sciences