Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Department of Computer Science Technical Report
 

Summary: $DFKHQ
Department of Computer Science
Technical Report
Modular Termination Proofs of
Recursive Java Bytecode Programs
by Term Rewriting
Marc Brockschmidt, Carsten Otto, and J¨urgen Giesl
ISSN 0935­3232 · Aachener Informatik Berichte · AIB-2011-02
RWTH Aachen · Department of Computer Science · April 2011
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/
Modular Termination Proofs of Recursive Java
Bytecode Programs by Term Rewriting
M. Brockschmidt, C. Otto, J. Giesl
LuFG Informatik 2, RWTH Aachen University, Germany
Abstract
In [4, 14] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) pro-
grams automatically. Here, JBC programs are first transformed to finite termination graphs which
represent all possible runs of the program. Afterwards, the termination graphs are translated to

  

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

 

Collections: Computer Technologies and Information Sciences