Abstract
Our task is to define the commands (statements) of a small language. This will be done as follows. For any command S and predicate R, which describes the desired result of executing S, we will define another predicate, denoted by wp(S,R), that represents
-
(7.1)
the set of all states such that execution of S begun in any one of them is guaranteed to terminate in a finite amount of time in a state satisfying R. â–¡
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
© 1981 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Gries, D. (1981). The Predicate Transformer wp. In: The Science of Programming. Text and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5983-1_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5983-1_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96480-5
Online ISBN: 978-1-4612-5983-1
eBook Packages: Springer Book Archive