Overview
The original proof method for termination of programs originated in [FL 67], for a family of flowchart-like programs, and it still underlies proof-methods for more elaborate kinds of programs. The basic idea is to associate some kind of a measure or ranking, with intermediate states of a computation, which decreases as the computation proceeds. The ranking has to be such that no infinite strictly decreasing sequence of ranks is possible. As a result, no infinite computation is possible.
We start by reviewing some of the basic notions involved. Then the original Floyd-method is explained in terms of a deterministic sub-language of GC, after which the method is extended to nondeterministic GC programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Francez, N. (1986). Termination and Well-Foundedness. In: Fairness. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4886-6_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4886-6_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9347-7
Online ISBN: 978-1-4612-4886-6
eBook Packages: Springer Book Archive