ScholarLens Back to search
2010•DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)Open access

Automated Termination Analysis of Java Bytecode by Term Rewriting

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

Open full text 72 citations

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 72 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Java bytecode, Bytecode, Programming language, Computer science, Java, Rewriting, Term (time), Java Modeling Language

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Automated Termination Analysis of Java Bytecode by Term Rewriting — Research Paper | ScholarLens