A Region Graph Based Approach to Termination Proofs
Automated termination proofs are indispensable in the mechanic verification of many program properties. While most of the recent work on automated termination proofs focuses on the construction of linear ranking functions, we develop an approach based on region graphs in which regions define subsets of variable values that have different effects on loop termination. In order to establish termination, we check whether (1) any region will be exited once it is entered, and (2) no region is entered an infinite number of times. We show the effectiveness of our proof method by experiments with Java code using a prototype implementation of our approach.
KeywordsNegative Region Model Check Positive Region Linear Inequality Integer Variable
- 5.Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of 5th Symposium on Principles of Programming Languages (POPL 1978), pp. 84–97 (1978)Google Scholar
- 9.Leue, S., Wei, W.:A region graph based approach to termination proofs. Technical report soft-06-01, University of Konstantz (2006)Google Scholar