Abstract
The paper discusses local correctness criteria and local correctness proofs of semicoroutines subject to certain simplifying assumptions. A nontrivial worked example is given.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Wang, O.-J. Dahl: Coroutine sequencing in a block structured environment. BIT 11(1971), pp. 425–449.
M. Clint: Program proving: Coroutines. Acta Informatica 2 (1973), pp. 50–63.
O.-J. Dahl, E.W. Dijkstra, C.A.R. Hoare: Structured programming. Academic Press, 1972.
D.E. Knuth: A review of "Structured programming". STAN-Cs-73-371.
D.E. Knuth: Selected topics in computer science. Lecture Note Series, Mathematical Institute, University of Oslo (1973).
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dahl, OJ. (1975). An approach to correctness proofs of semicoroutines. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_678
Download citation
DOI: https://doi.org/10.1007/3-540-07162-8_678
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07162-4
Online ISBN: 978-3-540-37492-3
eBook Packages: Springer Book Archive