A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Automated Termination Proofs for Java Programs with Cyclic Data
[chapter]
2012
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-31424-7_13
fatcat:b6myal6hojfqlkwccpewcanl7m