Proving Termination by Divergence

We describe a simple and efficient algorithm for proving the termination of a class of loops with nonlinear assignments to variables. The method is based on divergence testing for each variable in the cone-of-influence of the loop’s termination condition. The analysis allows us to automatically prove the termination of loops that cannot be handled using previous techniques. The paper closes with experimental results using short examples drawn from industrial code.

• Type: Conference
• Year: 2007
• Where: SEFM
• Authors: Domagoj Babic, Alan J. Hu, Zvonimir Rakamaric, Byron Cook
• Keywords: Efficient Algorithm, Loop’s Termination Condition, Nonlinear Assignments, SEFM 2007, Software Engineering