Abstract
We describe a notation for specifying for-loops which enumerate the elements of a set according to a partial ordering. This serves to separate implementation and efficiency issues from correctness issues. In order to demonstrate its usefulness we apply our notation to three completely different problems and give correctness proofs. Also, we show that our for-loops nicely combine with a formalism for specifying concurrency.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.-H. Chu, K.-S. Fu: VLSI architectures for high speed recognition of context-free languages and finite-state languages, SIGARCH Newsletter 10,3(1982) 43–49.
E.W. Dijkstra, A.J.M. van Gasteren: An introduction to three algorithms for sorting in situ, Inf. Process. Lett. 15,3(1982) 129–133.
E.W. Dijkstra: A discipline of programming, Prentice-Hall, Englewood Cliffs (1976).
U. Furbach, L. Schmitz: Rigorous derivation of a sophisticated algorithm: smoothsort, Techn. Report Nr. 8302, FB Informatik, Hochschule der Bundeswehr München (1983).
D. Gries, N. Gehani: Some ideas on data types in high-level languages, CACM 20,6(1977) 414–420.
M. Harrison: Introduction to formal language theory, Addison-Wesley, Reading, Mass. (1978).
C.A.R. Hoare: A note on the for statement, BIT 12(1972) 334–341.
C. Lengauer, E.C.R. Hehner: A methodology for programming with concurrency: an informal presentation, Sci. Comput. Programming 2,1(1982) 1–18.
C. Lengauer: A methodology for programming with concurrency: the formalism, Sci. Comput. Programming 2,1(1982) 19–52.
B. Liskov, A. Snyder, R. Atkinson, C. Schaffert: Abstraction mechanisms in CLU, CACM 20,8(1977) 564–576.
L. Schmitz: An improved transitive closure algorithm, Computing 30,4(1983) 359–371.
M. Shaw, W. Wulf, R.L. London: Abstraction and verification in Alphard: defining and specifying iteraction and generators, CACM 20,8(1977) 553.
R. Tarjan: Depth-first search and linear graph algorithms, SIAM J. Comput. 1(1972) 146–160.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heilbrunner, S., Schmitz, L. (1984). For statements with restricted enumerations. In: Paul, M., Robinet, B. (eds) International Symposium on Programming. Programming 1984. Lecture Notes in Computer Science, vol 167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12925-1_35
Download citation
DOI: https://doi.org/10.1007/3-540-12925-1_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12925-7
Online ISBN: 978-3-540-38809-8
eBook Packages: Springer Book Archive