Seminar 5 July 10:00, 2012

Automated Termination Proofs for Java Programs with Cyclic Data

 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.