Program construction and verification
Program construction and verification
Predicate calculus and program semantics
Predicate calculus and program semantics
The Science of Programming
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
Design of Well-Structured and Correct Programs
Design of Well-Structured and Correct Programs
Automatic derivation of loop termination conditions to support verification
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Hi-index | 0.00 |
The traditional method for proving loop termination requires us to define a bound function of program variables. The criterion in this method is well-defined and can be easy to apply, as such functions are obvious for many loops. However in some cases, it can be very difficult to define a bound function. In this paper, we discuss how to prove loop termination by using alternative methods. First we show how to prove loop termination by solving a recursive relation that defines the number of iterations remaining in any execution state. Then we introduce a step-by-step approach for applying this recursive relation method. This new method can also be used to investigate preconditions that lead to loop termination in non-deterministic cases. Finally, we illustrate another method that uses a more general criterion for proving loop termination. The new criterion is a generalization of the classical one. This paper does not attempt to offer a one-size-fits-all approach. Rather, it provides some alternative methods that make proving loop termination easier in some cases, where termination might otherwise be difficult if not impossible to prove.