For statements with restricted enumerations

  • S. Heilbrunner
  • L. Schmitz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 167)


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.


Partial Order Semantic Relation Statement Sequence Restricted Enumeration Loop Body 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [C&F 82]
    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.Google Scholar
  2. [D&G 82]
    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.Google Scholar
  3. [DIJ 76]
    E.W. Dijkstra: A discipline of programming, Prentice-Hall, Englewood Cliffs (1976).Google Scholar
  4. [F&S 82]
    U. Furbach, L. Schmitz: Rigorous derivation of a sophisticated algorithm: smoothsort, Techn. Report Nr. 8302, FB Informatik, Hochschule der Bundeswehr München (1983).Google Scholar
  5. [G&G 77]
    D. Gries, N. Gehani: Some ideas on data types in high-level languages, CACM 20,6(1977) 414–420.Google Scholar
  6. [HAR 78]
    M. Harrison: Introduction to formal language theory, Addison-Wesley, Reading, Mass. (1978).Google Scholar
  7. [HOA 72]
    C.A.R. Hoare: A note on the for statement, BIT 12(1972) 334–341.Google Scholar
  8. [L&H 82]
    C. Lengauer, E.C.R. Hehner: A methodology for programming with concurrency: an informal presentation, Sci. Comput. Programming 2,1(1982) 1–18.Google Scholar
  9. [LEN 82]
    C. Lengauer: A methodology for programming with concurrency: the formalism, Sci. Comput. Programming 2,1(1982) 19–52.Google Scholar
  10. [LSA 77]
    B. Liskov, A. Snyder, R. Atkinson, C. Schaffert: Abstraction mechanisms in CLU, CACM 20,8(1977) 564–576.Google Scholar
  11. [SCH 83]
    L. Schmitz: An improved transitive closure algorithm, Computing 30,4(1983) 359–371.Google Scholar
  12. [SWL 77]
    M. Shaw, W. Wulf, R.L. London: Abstraction and verification in Alphard: defining and specifying iteraction and generators, CACM 20,8(1977) 553.Google Scholar
  13. [TAR 72]
    R. Tarjan: Depth-first search and linear graph algorithms, SIAM J. Comput. 1(1972) 146–160.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • S. Heilbrunner
    • 1
  • L. Schmitz
    • 1
  1. 1.Hochschule der Bundeswehr MünchenNeubibergGermany West

Personalised recommendations