Automated termination proofs for Java programs with cyclic data

  • Authors:

  • Marc Brockschmidt;Richard Musiol;Carsten Otto;Jürgen Giesl

  • Affiliations:

  • LuFG Informatik 2, RWTH Aachen University, Aachen, Germany;LuFG Informatik 2, RWTH Aachen University, Aachen, Germany;LuFG Informatik 2, RWTH Aachen University, Aachen, Germany;LuFG Informatik 2, RWTH Aachen University, Aachen, Germany

  • Venue:
  • CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems (TRSs) and then, existing methods and tools are used to prove termination of the resulting TRSs. In this paper, we extend our technique in order to prove termination of algorithms on cyclic data such as cyclic lists or graphs automatically. We implemented our technique in the tool AProVE and performed extensive experiments to evaluate its practical applicability.