Seminar 16 Feb, 2012

Proving Termination of Java Bytecode with Cyclic Data


 In earlier work, we developed a technique to prove termination of Java Bytecode (JBC) automatically: first, JBC 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
 presentation, 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 n the tool AProVE and performed extensive experiments to evaluate its practical applicability.