Control structures in single block programs

  • Venelin K. Evtimov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Böhm, C. and Jacopini, G., Flow diagrams, Turing machines and languages with only two formation rules. Communications of the ACM, 9(1966), 366–371.CrossRefGoogle Scholar
  2. 2.
    Cooper, D.C., Programs for mechanical program verification. In Machine Intelligence 6, (B. Meltzer and D. Michie, Eds.), pp. 43–59, 1971. Edinburgh University Press, Edinburgh, 1971.Google Scholar
  3. 3.
    Dijkstra, E.W., Guarded commands, non-determinacy and a calculus for the derivation of programs. Report EWD 418, Burroughs, Nuenen, 1974. Also: Communications of the ACM (to appear).Google Scholar
  4. 4.
    Engeler, E., Structure and meaning of elementary programs. In Lecture Notes in Mathematics 188, (E. Engeler, Ed.), pp. 89–101, 1971. Springer-Verlag, Berlin, 1971.Google Scholar
  5. 5.
    Evtimov, V.K., Bases of paths in correctness proofs. In Proc. 3d International Symposium MFCS'74, Lecture Notes in Computer Science 28, Springer-Verlag, Berlin, 1975, pp. 359–360.Google Scholar
  6. 6.
    Glushkov, V.M., Automata theory and formal microprogram transformations. Kibernetika (Russian), 1(1965) 5, 1–9. English translation: Cybernetics, 1(1965)5, 1–8. The Faraday Press, Inc., New York, 1966.Google Scholar
  7. 7.
    Glushkov, V.M. and Letichevsky, A.A., Theory of algorithms and discrete processors. In Advances of Information Systems Science 1, (J.T. Tou, Ed.), pp. 1–58, 1969. Plenum Press, New York, 1969.Google Scholar
  8. 8.
    Glushkov, V.M., Tseitlin, G.E. and Yushchenko, E.L., Algebra, Languages, Programming (Russian), Naukova Dumka, Kiev, 1974.Google Scholar
  9. 9.
    Harary, F., Graph Theory, Addison-Wesley Publishing Co., Reading, Mass., 1969.Google Scholar
  10. 10.
    Hecht, M.S. and Ullman, J.D., Flow graph reducibility. SIAM Journal on Computing, 1(1972), 188–202.CrossRefGoogle Scholar
  11. 11.
    Hoare, C.A.R., A note on the for statement. BIT, 12(1972), 334–341.Google Scholar
  12. 12.
    Hoare, C.A.R., An axiomatic definition of the programming language Pascal. In Lecture Notes in Computer Science 5, (A.P. Ershov and V.A. Nepomniashchy, Eds.), pp. 1–16, 1974. Springer-Verlag, Berlin, 1974.Google Scholar
  13. 13.
    Knuth, D.E., Structured programming with go to statements. Computing Surveys, 6(1974), 261–301.CrossRefGoogle Scholar
  14. 14.
    Lyons, T. and Bruno, J., An interactive system for program verification. In Algorithm Specification (R. Rustin, Ed.), pp. 117–141, 1972. Prentice-Hall, Englewood Cliffs, N.J., 1972.Google Scholar
  15. 15.
    Mills, H.D., Syntax-directed documentation for PL360. Communications of the ACM, 13(1970), 216–222.CrossRefGoogle Scholar
  16. 16.
    Zelkowitz, M.V. and Bail, W.G., Optimization of structured programs. Software — Practice and Experience, 4(1974), 51–57.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Venelin K. Evtimov
    • 1
  1. 1.Theoretical Cybernetics DepartmentKiev State UniversityUSSR

Personalised recommendations