Abstract
In Chapter 8, it was shown how functional programs can be regarded as elements of a relation algebra. In this chapter, we consider imperative programs, which we view as computing an input-output relation on a set of states. We are interested here in programs that are meant to terminate, not in reactive programs. Our programming language is Dijkstra’s language of guarded commands [Dijkstra 1976], which allows the expression of nondeterminism, thus making a relational approach very natural.
The first and second authors acknowledge the financial support of the NSERC (Natural Sciences and Engineering Research Council) of Canada.
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.
Notes
The first and second authors acknowledge the financial support of the NSERC (Natural Sciences and Engineering Research Council) of Canada.
As in Chapt. 8, the symbol D is used to remind of the qualificative demonic.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Wien
About this chapter
Cite this chapter
Desharnais, J., Mili, A., Nguyen, T.T. (1997). Refinement and Demonic Semantics. In: Brink, C., Kahl, W., Schmidt, G. (eds) Relational Methods in Computer Science. Advances in Computing Sciences. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6510-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6510-2_11
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82971-4
Online ISBN: 978-3-7091-6510-2
eBook Packages: Springer Book Archive