Program termination using Z-transform theory

摘要

This paper deals with the termination of flow chart programs. Programs with loops are always difficult to prove. A method of generating a set of recurrence equations for a given program with a single loop is explained. A new function, called the slack function, is introduced and then Z-transformed. Using the well-developed theory of Z-transforms, the termination of the program is studied.