Termination Graphs for Java Bytecode

DOI10.1007/978-3-642-17172-7_2zbMath1309.68038OpenAlexW1808131711MaRDI QIDQ3058449

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

Publication date: 22 November 2010

Published in: Verification, Induction, Termination Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17172-7_2

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Automatically proving termination and memory safety for programs with pointer arithmetic ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ A framework for computing finite SLD trees

Uses Software

• Isabelle/HOL
• AProVE

Cites Work

• Unnamed Item
• Termination of rewriting
• On proving the termination of algorithms by machine
• Isabelle/HOL. A proof assistant for higher-order logic
• Automated termination proofs for logic programs by term rewriting
• Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
• Proving Termination of Integer Term Rewriting
• Termination of logic programs: the never-ending story
• Automated Termination Analysis of Java Bytecode by Term Rewriting
• Automatic Termination Proofs for Programs with Shape-Shifting Heaps

This page was built for publication: Termination Graphs for Java Bytecode