An algebraic definition for control structures. (English) Zbl 0456.68015


68Q60 Specification and verification (program logics, model checking, etc.)
Full Text: DOI


[2] Arsac, J., La Construction de Programmes Structurés (1977), Dunod: Dunod Paris · Zbl 0451.68014
[3] Ashcroft, E.; Manna, Z., The translation of GOTO programmes into WHILE programs, (Freiman, C. V., Information Processing, 71 (1971), North-Holland: North-Holland Amsterdam), 250-255
[4] Böhm, C.; Jacopini, G., Flow diagrams, Türing machines and language; with only two formation rules, Comm. ACM, 9, 366-371 (1966) · Zbl 0145.24204
[5] Burstall, R.; Darlington, J., A transformation system for developing recursive programs, J. ACM, 24, 1, 44-67 (1977) · Zbl 0343.68014
[6] Courcelle, B., Recursive schemes, algebraic trees and deterministic languages, Proc. 15th Conference on Switching and Automata Theory (1974)
[7] Courcelle, B.; Nival, M., Algebraic families of interpretation, Proc. 17th Conference on Foundations of Computer Science (1976)
[8] Cousineau, G., Les arbres à feuilles indicées: un cadre algébrique pour l“étude des structures de contrôle, (Thèse d”Etat, VII (1977), Université Paris)
[9] Dahl, O.; Dijkstra, E. W.; Hoare, C. A.R., Structured Programming (1972), Academic Press: Academic Press London · Zbl 0267.68001
[11] Doner, Tree acceptors and some of their applications, J. Comput. System Sci., 4, 406-451 (1970) · Zbl 0212.02901
[12] Gerhardt, S. L., Knowledge about programs, Proc. IEEE Conference on Reliable Software (1975), Los Angeles
[13] Kasaï, Translatability of flowcharts into WHILE programs, J. Comput. System Sci., 9, 177-195 (1974) · Zbl 0291.68005
[14] Kasami, T.; Paterson, W.; Tokura, N., On the capabilities of WHILE, REPEAT and EXIT statements, Comm. ACM, 16, 8 (1973) · Zbl 0279.68008
[15] Knuth, D., Structured programming with goto statement, ACM Comput. Survey, 6, 4 (1974)
[16] Knuth, D.; Floyd, R., Notes on avoiding GOTO statements, Information Processing Lett., 1, 23-31 (1971) · Zbl 1260.68047
[17] Kosaraju, R., Analysis of structured programs, J. Comput. System Sci., 9, 232-255 (1974) · Zbl 0293.68014
[18] Loveman, D. B., Program improvements by source to source transformations, J. ACM, 24, 1, 121-145 (1977) · Zbl 0359.68016
[19] Manna, Z., Mathematical Theory of Computation (1974), McGraw-Hill: McGraw-Hill New York · Zbl 0353.68066
[20] Nivat, M., On the Interpretation of Recursive Program Schemes, (Symposium Mathematica, 15 (1975), Academic Press: Academic Press New York) · Zbl 0384.68016
[21] Nolin, L.; Ruggiu, C., Sigact-Sigplan Symposium on the Principles of Programming Languages, Boston. Sigact-Sigplan Symposium on the Principles of Programming Languages, Boston, A formalisation of EXEL (1973)
[22] Rosen, B., Tree-manipulating systems and the Church-Rosser theorems, J. ACM, 20, 160-187 (1973) · Zbl 0267.68013
[24] Standish, T. A.; Harriman, D. C.; Killer, D. F.; Neighbors, J. M., Improving and refining programs by program manipulation, Proc. ACM National Conference, 509-516 (1976)
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.