License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2010.259
URN: urn:nbn:de:0030-drops-26570
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2657/

Otto, Carsten ; Brockschmidt, Marc ; von Essen, Christian ; Giesl, Jürgen

Automated Termination Analysis of Java Bytecode by Term Rewriting

pdf-format:
Dokument 1.pdf (227 KB)


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.

BibTeX - Entry

@InProceedings{otto_et_al:LIPIcs:2010:2657,
  author =	{Carsten Otto and Marc Brockschmidt and Christian von Essen and J{\"u}rgen Giesl},
  title =	{{Automated Termination Analysis of Java Bytecode by Term Rewriting}},
  booktitle =	{Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
  pages =	{259--276},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-18-7},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{6},
  editor =	{Christopher Lynch},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2657},
  URN =		{urn:nbn:de:0030-drops-26570},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.RTA.2010.259},
  annote =	{Keywords: Java Bytecode, termination, term rewriting}
}

Keywords: Java Bytecode, termination, term rewriting
Seminar: Proceedings of the 21st International Conference on Rewriting Techniques and Applications
Issue date: 2010
Date of publication: 06.07.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI