Seminar 17 Feb, 2012

Proving Non-Termination for Java Bytecode



 Recently, we developed an approach for automated termination proofs of Java Bytecode (JBC), which is based on constructing and analyzing termination graphs. These graphs represent all possible program executions in a finite way. In this presentation, we show that this approach can also be used to detect non-termination. We implemented our results in the termination prover AProVE and provide experimental evidence for the power of our approach.