Termination of Nested Loop

The verification of termination is a difficult problem. While most of the recent work on automated termination proofs focuses on the construction of linear ranking functions for unnested loops, we present an algorithm based on region graphs to prove termination of nested loops. The method can prove the termination of terminating nested loops that may not have linear ranking function. For the programs we have considered, this approach converges faster and sufficiently.