Termination graphs for Java bytecode

Authors:
Marc Brockschmidt;Carsten Otto;Christian Von Essen;Jürgen Giesl
Affiliations:
LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany
Venue:
Verification, induction termination analysis
Year:
2010

Citing 16
Cited 3

Termination of rewriting

Journal of Symbolic Computation
Mathematical induction

Handbook of logic in artificial intelligence and logic programming
On proving the termination of algorithms by machine

Artificial Intelligence
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Java Virtual Machine Specification

Java Virtual Machine Specification
Practical Methods for Proving Program Termination

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
A machine-checked model for a Java-like language, virtual machine, and compiler

ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination Analysis of Java Bytecode

FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Proving Termination of Integer Term Rewriting

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Automated termination proofs for logic programs by term rewriting

ACM Transactions on Computational Logic (TOCL)
A termination analyzer for Java bytecode based on path-length

ACM Transactions on Programming Languages and Systems (TOPLAS)
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic termination proofs for programs with shape-shifting heaps

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automated termination proofs for Java programs with cyclic data

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Automated detection of non-termination and nullpointerexceptions for Java Bytecode

FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible 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 termination graph implies termination of the original JBC program.