Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Submitted to the International Conference on Rewriting Techniques and Applications http://rewriting.loria.fr/rta/
 

Summary: Submitted to the International Conference on Rewriting Techniques and Applications
http://rewriting.loria.fr/rta/
AUTOMATED TERMINATION ANALYSIS OF JAVA BYTECODE
BY TERM REWRITING
C. OTTO AND M. BROCKSCHMIDT AND C. VON ESSEN AND J. GIESL
LuFG Informatik 2, RWTH Aachen University, Germany
Abstract. 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 techniques and tools developed for TRS termination can now be
used for imperative object-oriented languages like Java, which can be compiled into JBC.
1. Introduction
Termination of TRSs and logic programs has been studied for decades. But as impera-
tive programs dominate in practice, recently many results on termination of imperative
programs were developed as well (e.g., [2, 3, 4, 5, 12]). Our goal is to re-use the wealth
of techniques and tools from TRS termination when tackling imperative object-oriented
programs. Similar TRS-based approaches have already proved successful for termination
analysis of Prolog and Haskell [10, 17]. A first approach to prove termination of imperative
programs by transforming them to TRSs was presented in [7]. However, [7] only analyzes a
toy programming language without heap, whereas our goal is to analyze JBC programs.
JBC [14] is an assembly-like object-oriented language designed as intermediate format

  

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

 

Collections: Computer Technologies and Information Sciences