{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:13Z","timestamp":1725662893497},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540073895"},{"type":"electronic","value":"9783540375852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07389-2_198","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:54:58Z","timestamp":1330185298000},"page":"212-218","source":"Crossref","is-referenced-by-count":0,"title":["Control structures in single block programs"],"prefix":"10.1007","author":[{"given":"Venelin K.","family":"Evtimov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1145\/355592.365646","volume":"9","author":"C. B\u00f6hm","year":"1966","unstructured":"B\u00f6hm, C. and Jacopini, G., Flow diagrams, Turing machines and languages with only two formation rules. Communications of the ACM, 9(1966), 366\u2013371.","journal-title":"Communications of the ACM"},{"key":"21_CR2","first-page":"43","volume-title":"Machine Intelligence 6","author":"D. C. Cooper","year":"1971","unstructured":"Cooper, D.C., Programs for mechanical program verification. In Machine Intelligence 6, (B. Meltzer and D. Michie, Eds.), pp. 43\u201359, 1971. Edinburgh University Press, Edinburgh, 1971."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1145\/800027.808417"},{"key":"21_CR4","first-page":"89","volume-title":"Lecture Notes in Mathematics 188","author":"E. Engeler","year":"1971","unstructured":"Engeler, E., Structure and meaning of elementary programs. In Lecture Notes in Mathematics 188, (E. Engeler, Ed.), pp. 89\u2013101, 1971. Springer-Verlag, Berlin, 1971."},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/3-540-07162-8_695","volume-title":"Proc. 3d International Symposium MFCS'74","author":"V. K. Evtimov","year":"1975","unstructured":"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\u2013360."},{"issue":"5","key":"21_CR6","first-page":"1","volume":"1","author":"V. M. Glushkov","year":"1965","unstructured":"Glushkov, V.M., Automata theory and formal microprogram transformations. Kibernetika (Russian), 1(1965) 5, 1\u20139. English translation: Cybernetics, 1(1965)5, 1\u20138. The Faraday Press, Inc., New York, 1966.","journal-title":"Kibernetika"},{"key":"21_CR7","first-page":"1","volume-title":"Advances of Information Systems Science 1","author":"V. M. Glushkov","year":"1969","unstructured":"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\u201358, 1969. Plenum Press, New York, 1969."},{"key":"21_CR8","volume-title":"Algebra, Languages, Programming","author":"V. M. Glushkov","year":"1974","unstructured":"Glushkov, V.M., Tseitlin, G.E. and Yushchenko, E.L., Algebra, Languages, Programming (Russian), Naukova Dumka, Kiev, 1974."},{"key":"21_CR9","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F., Graph Theory, Addison-Wesley Publishing Co., Reading, Mass., 1969."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0201014","volume":"1","author":"M. S. Hecht","year":"1972","unstructured":"Hecht, M.S. and Ullman, J.D., Flow graph reducibility. SIAM Journal on Computing, 1(1972), 188\u2013202.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/BF01932305","volume":"12","author":"C. A. R. R. Hoare","year":"1972","unstructured":"Hoare, C.A.R., A note on the for statement. BIT, 12(1972), 334\u2013341.","journal-title":"BIT"},{"key":"21_CR12","first-page":"1","volume-title":"Lecture Notes in Computer Science 5","author":"C. A. R. R. Hoare","year":"1974","unstructured":"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\u201316, 1974. Springer-Verlag, Berlin, 1974."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/356635.356640","volume":"6","author":"D. E. Knuth","year":"1974","unstructured":"Knuth, D.E., Structured programming with go to statements. Computing Surveys, 6(1974), 261\u2013301.","journal-title":"Computing Surveys"},{"key":"21_CR14","first-page":"117","volume-title":"Algorithm Specification","author":"T. Lyons","year":"1972","unstructured":"Lyons, T. and Bruno, J., An interactive system for program verification. In Algorithm Specification (R. Rustin, Ed.), pp. 117\u2013141, 1972. Prentice-Hall, Englewood Cliffs, N.J., 1972."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/362258.362271","volume":"13","author":"H. D. Mills","year":"1970","unstructured":"Mills, H.D., Syntax-directed documentation for PL360. Communications of the ACM, 13(1970), 216\u2013222.","journal-title":"Communications of the ACM"},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/spe.4380040106","volume":"4","author":"M. V. Zelkowitz","year":"1974","unstructured":"Zelkowitz, M.V. and Bail, W.G., Optimization of structured programs. Software \u2014 Practice and Experience, 4(1974), 51\u201357.","journal-title":"Software \u2014 Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1975 4th Symposium, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, September 1\u20135, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07389-2_198.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:23Z","timestamp":1605643043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07389-2_198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540073895","9783540375852"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-07389-2_198","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}