Abstract
Now let us see how the σ-type temporal logic ML σ can be used to reason about programs and how program properties can be described. The temporal logic of programs will not mention programs explicitly, but it will operate on the computational paths realizing the execution of a program. This is one of the fundamental differences between the viewpoints of temporal logic and dynamic logic, since the latter does not directly operate on the computation but only on their input and output elements, yet it can directly refer to many programs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gergely, T., Úry, L. (1991). Temporal Logical Description of Program Properties. In: First-Order Programming Theories. EATCS Monographs on Theoretical Computer Science, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58205-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-58205-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63503-8
Online ISBN: 978-3-642-58205-9
eBook Packages: Springer Book Archive