zbMATH — the first resource for mathematics

Analysis of structured programs. (English) Zbl 0293.68014

68N01 General topics in the theory of software
68Q45 Formal languages and automata
68Q25 Analysis of algorithms and problem complexity
Full Text: DOI
[1] Ashcroft, E.; Manna, Z., The translation of “go to” programs, booklet TA-2, () · Zbl 0263.68016
[2] Baker, F.T., Chief programmer team management of production programming, IBM systems J., 11, 56-73, (1972)
[3] Böhm, C.; Jacopini, G., Flow diagrams, Turing machines and languages with only two formation rules, Comm. ACM, 9, 366-371, (1966) · Zbl 0145.24204
[4] Bruno, J.; Steiglitz, K., The expression of algorithms by charts, J. assoc. comput. Mach., 19, 517-525, (1972) · Zbl 0242.68017
[5] Cooper, D.C., Böhm and Jacopini’s reduction of flow charts, Comm. ACM, 10, 463, (1967)
[6] Cooper, D.C., Some transformations and standard forms of graphs, with applications to computer programs, Machine intelligence, 2, 21-32, (1967) · Zbl 0223.05106
[7] Dahl, O.-J.; Dijkstra, E.W.; Hoare, C.A.R., ()
[8] Dijkstra, E.W., Go to statement considered harmful, Comm. ACM, 11, 147-148, (1968)
[9] Hecht, M.S.; Ullman, J.D., Flow graph reducibility, SIAM J. comput., 1, 188-202, (1972) · Zbl 0265.68031
[10] Knuth, D.E.; Floyd, R.W.; Knuth, D.E.; Floyd, R.W., Notes on avoiding “go to” statements, Information processing letters, Information processing letters, 1, 177, (1972), Errata · Zbl 1260.68047
[11] Kosaraju, S. Rao, Analysis of structured programs, () · Zbl 0305.68011
[12] Ledgard, H.F., Examples of structured programs, (1973), University of Massachusetts, unpublished paper
[13] Mills, H.D., Mathematical foundations for structured programming, () · Zbl 0191.18404
[14] Peterson, W.W.; Kasami, T.; Tokura, N., On the capabilities of while, repeat, and exit statement, Comm. ACM, 16, 503-512, (1973) · Zbl 0279.68008
[15] Wulf, W.A., Programming without the go to, booklet TA-3, ()
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.