Nothing Special   »   [go: up one dir, main page]

Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 32))

  • 1869 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  Google Scholar 

  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. 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. 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. 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. 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. 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. Glushkov, V.M., Tseitlin, G.E. and Yushchenko, E.L., Algebra, Languages, Programming (Russian), Naukova Dumka, Kiev, 1974.

    Google Scholar 

  9. Harary, F., Graph Theory, Addison-Wesley Publishing Co., Reading, Mass., 1969.

    Google Scholar 

  10. Hecht, M.S. and Ullman, J.D., Flow graph reducibility. SIAM Journal on Computing, 1(1972), 188–202.

    Article  Google Scholar 

  11. Hoare, C.A.R., A note on the for statement. BIT, 12(1972), 334–341.

    Google Scholar 

  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. Knuth, D.E., Structured programming with go to statements. Computing Surveys, 6(1974), 261–301.

    Article  Google Scholar 

  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. Mills, H.D., Syntax-directed documentation for PL360. Communications of the ACM, 13(1970), 216–222.

    Article  Google Scholar 

  16. Zelkowitz, M.V. and Bail, W.G., Optimization of structured programs. Software — Practice and Experience, 4(1974), 51–57.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Evtimov, V.K. (1975). Control structures in single block programs. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_198

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_198

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics