Abstract
Structured Programming has raised much attention to the problem of program schemata (flow diagrams) decomposability. In fact, the possibi lity of writing a program, in a top-down fashion, i.e. by successive refiniments of its parts, and the possibility of considering a program as consisting of subprograms, depend also on the possibility of identi fying within a flow diagram some elementary control structures which constitute its components.
This research has been sponsored by HISI under Project AST and by CNR (Progetto speciale per l’Informatica)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C.Böhm, G.Jacopini, Flow diagrams, Turing and Languages with only two Formation Rules, C.ACM 9.5 (1966), 366–371.
J.M. Cadiou, Z. Manna, Recursive Definitions of Partial Functions and their Computations, Proc.ACM Conference of Proving Assertions about Programs, Las Cruces, New Mexico (1972), 58–65.
G.De Michelis, Recursive Functions not dependent on the Computational Rules, Proc.International Computing Symposium, Davos, North Holland (1974), 25–31.
D.E.Knuth, R.W.Floyd, Notes on avoiding GOTO statements, Inf.Proc. Letters 1 (1971), 23–31.
S.Rao Kosaraju, Analysis of Structured Programs, Proc.V.Annual ACM Symposium on Theory of Computation, Austin (1973), 240–252.
A.Maggiolo Schettinï, H.R.Strong, A Graph-Theoretic Algorithm for trasforming Recursive Programs, Atti del Congresso di Informatica Teorica AICA, Pisa (1973), 377–392.
M.Maiocchi, R. Polillo, Tecniche di programmazione strutturata, Informatica (to appear).
J.M.Morris, Lambda - Calculus Models of Programming Launguages,MAC TR 57, MIT (1968).
W.W.Peterson, T.Kasami, N.Tokura, On the Capabilities of While, Repeat and Exit statements, C. ACM 16.8 (1973), 503–512.
D.Scott, The Lattice of Flow Diagrams, Symposium on Semantics of Algorithmic Languages, Springer Lecture Notes in Mathematics, 188 (1971), 311–366.
W.A.Wulf, Programming without the goto, Proc. IFIP Congress (1971), 3, 84–88.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Michelis-Carla Simone, G. (1974). Semantic Characterization of Flow Diagrams and Their Decomposability. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-21545-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06841-9
Online ISBN: 978-3-662-21545-6
eBook Packages: Springer Book Archive