×

zbMATH — the first resource for mathematics

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

MSC:
68Q60 Specification and verification (program logics, model checking, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] J. Arsac, Langages sans étiquettes et transformations de programmes in: Loeckx, Ed., Automata, Languages and Programming, Lecture Notes in Computer Science 14(Springer, Berlin) 112-128. · Zbl 0291.68030
[2] Arsac, J., La construction de programmes structurés, (1977), Dunod Paris · Zbl 0451.68014
[3] Ashcroft, E.; Manna, Z., The translation of GOTO programmes into WHILE programs, (), 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, ()
[9] Dahl, O.; Dijkstra, E.W.; Hoare, C.A.R., Structured programming, (1972), Academic Press London · Zbl 0267.68001
[10] J. de Bakker, Recursive procedures, Mathematical Center Tracts. 24. · Zbl 0274.02015
[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 New York · Zbl 0353.68066
[20] Nivat, M., On the interpretation of recursive program schemes, () · Zbl 0384.68016
[21] Nolin, L.; Ruggiu, C., 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
[23] D. Scott, The lattice of flow-diagrams, in: Engeler, Ed., Symposium on Semantics of Algorithmic Languages, Lectures Notes in Mathematics {\bf188} (Springer, Berlin).
[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.