Banachowski, L. Investigation of properties of programs by means of the extended algorithmic logic 1. Annal. Soc. Math. Pol., series IV, Fimdamenta Informaticae 1, 1 (1977), 93-119.

Google Scholar

[7]

Banachowski, L., et al. An intorduction to algorithmic logic. In Mathematical Foundations of Computer Science, Mazurkiewitcz and Pawlak, Eds., Banach Ctr. Publications, Warsaw, Poland, 1977, pp. 7-99.

Google Scholar

[8]

Bates, J.L. A logic for correct program development. Ph.D. th., Cornell Univ. Aug. 1979.

Digital Library

Google Scholar

[9]

Bekic. H. Definable operations in general algebras, and the theory of automata and flowcharts. Tech. rep., IBM Lab., Vienna, Dec. 1969.

Google Scholar

[10]

Benson, J.P. Structured programming techniques. Proc. IEEE Symp. on Comptr. Software Reliability, New York, April 1973, pp. 143-147.

Google Scholar

[11]

Bjorner, D. Flowchart machines, BIT 10 (1970), 415-442.

Crossref

Google Scholar

[12]

Bloom, S.L., and Tindell, R. Algebraic and graph theoretic characterizations of structured flowchart schemes. Theoretical Comptr. Sci. 9 (1979), 265-286.

Crossref

Google Scholar

[13]

Boehm, B.W. Software design and structuring. In Practical Strategies for Developing Large Software Systems, E. Horowitz, Ed., Addison-Wesley, Reading, Mass., pp. 103-128.

Google Scholar

[14]

Bohl, M. A Guide for Programmers. Prentice-Hall, Englewood Cliffs, N.J., 1978.

Digital Library

Google Scholar

[15]

Bohm, C., and Jacopini, G. Flow diagrams. Turing machines. and language with only two formation rules. Comm. ACM 9, 5 (May 1966), 366-371.

Digital Library

Google Scholar

[16]

Brainerd, W.S., and Landweber, L.H. Theory of Computation John Wiley and Sons, New York, 1974.

Digital Library

Google Scholar

[17]

Bruno, J., and Steiglitz, K. The expression of algorithm by charts, J. ACM 19, 3 (July 1972), 517-525.

Digital Library

Google Scholar

[18]

Burks, A. W., Goldstine, H. H., and von Neumann, J. Preliminary discussion of the logical design of an electronic computing. instruments, 1946, In J. von Neumann, Collected Works, Vol, v. A.H. Taub, Ed., MacMillan, New York, 1963, pp. 34-79.

Google Scholar

[19]

Chandra, A.K. Degrees of translatability and canonical forms in program schemas. Proc. 6th ACM(SIGACT) Symp. on Theory of Comptng., 1974, pp. 1-12.

Digital Library

Google Scholar

[20]

Clark, K., and Cowell, D. Programs, Machines and Computations: An Introduction to the Theory of Computing. McGraw-Hill, New York, 1976.

Google Scholar

[21]

Cohen, A.T., and Levi, L.S. Structured flowcharts for multiprocessing. Comptr. Language 3,4 (1978), 209-226.

Google Scholar

[22]

Cooper, D.C. Bohm and Jacopini's reduction of flow charts. Comm. ACM 10,8 (Aug. 1967), 463,473.

Digital Library

Google Scholar

[23]

Cooper, D.C. Programs for mechanical program verification. Machine Intell, 6, Edinburgh Univ. Press. 1971, pp. 43-59.

Google Scholar

[24]

Culik, K. Structured algorithms and structured programming Rep. CS-79-40, Dept. of Comptr. Sci., Penn. State Univ., Aug. 1979.

Google Scholar

[25]

Culik, K. Entry strong components and their applications (in computer science). Rep. TR Nov. 79-01, Dept. of Comptr. Sci., Wayne State Univ., Nov. 1979.

Google Scholar

[26]

Culik, K. What is a flowchart loop and about structured programming. SIGPLAN Notices (ACM) 15, 1 (Jan. 1980), 45-57.

Digital Library

Google Scholar

[27]

Denning, P.J. Comments on mathematical overkill. SIGPLAN Notices (ACM) 10, 9 (Sept. 1975), 10-11.

Digital Library

Google Scholar

[28]

Denning, P.J. Two misconceptions about structured programming, Proc. Ann. ACM Conf., Minneapolis, Minn., Oct. 1975, pp. 214-215.

Digital Library

Google Scholar

[29]

Dijkstra, E.W. Go to statement considered harmful. Comm. ACM 11, 3 (March 1968), 147-148.

Digital Library

Google Scholar

[30]

Donaldson, J.R. Structured programming, Datamation 19,12 (Dec. 1973), 52-54.

Google Scholar

[31]

Elgot, C.C. Monadiac computation and iterative algebraic theories. In Logic Colloquium '73, North-Holland Pub. Co., Amsterdam, 1975, pp. 175-230.

Crossref

Google Scholar

[32]

Elgot, C.C. Structured programming with and without go to statements. IEEE Trans. Software Eng. SE-2, 1 (March 1976), 41-54.

Digital Library

Google Scholar

[33]

Elgot, C.C. Structure and meaning of elementary programs. Proc. Symp. Semantics of Algorithmic Languages, Lecture Notes in Math., Vol. 188, Springer-Verlag, New York, 1971, pp. 89-101.

Google Scholar

[34]

Engelfriet, J. Simple Program Schemes and Formal Languages. Lecture Notes in Comptr. Sci. Vol. 20, Springer-Verlag, New York, 1974.

Digital Library

Google Scholar

[35]

Fischer, B., and Fischer, H. Structured Programming in PL/I and PL/C Marcel Dekker, Inc, New York and Basel, 1976.

Google Scholar

[36]

Goldschlager, L.M. Synchronous parallel computation Ph.D. th., TR-114, Univ. of Toronto, Dec. 1977.

Digital Library

Google Scholar

[37]

Goodman, S.E., and Hedetniemi, S.T. Introduction to the design and Analysis of Algorithms. McGraw-Hill, New York, 1977.

Digital Library

Google Scholar

[38]

Greibach, S.A. Theory of Program Structure; Schemes, Semantics, Verification. Lecture Notes in Comptr. Sci., Vol. 36, Springer-Verlag, New York, 1975.

Digital Library

Google Scholar

[39]

Harel, D. And/or programs: A new approach to structured programming. Proc IEEE Specifications for Reliable Software Conf., Cambridge, Mass., April 1979, pp. 80-90.

Google Scholar

[40]

Harel, D. On folk theorems, Comm. ACM 23, 7 (July 1980).

Digital Library

Google Scholar

[41]

Harel, D., Norvig, P., Rood, J., and To, T. A universal flowcharter. In Proc. AIAA/IEEE/ACM/NASA Comptrs. in Aerospace Conf. IL, Los Angeles, Calif., Oct. 1979, pp. 218-224.

Crossref

Google Scholar

[42]

Hirose, K., and Oya, M. Some results in general theory of flow charts. Proc. of the First USA-Japan Comptr. Conf., Sponsored by AFIPS, Tokyo, Janpan, Oct. 1972, pp. 367-371.

Google Scholar

[43]

Hirose, K., and Oya. M. General theory of flow charts. Comment. Math. Univ. St. Pauli, XI-2 (1972), 55-71.

Google Scholar

[44]

Hopkins, M.E. A case for goto. SIGPLAN Notices (ACM) 7, 11 (Nov. 1972), 59-62; Proc. ACM Ann. Conf., boston, 1972.

Google Scholar

[45]

Hughes, J.K., PL/I Structured Programming. John Wiley and Sons, New York, 1973.

Digital Library

Google Scholar

[46]

Hughes, J.K., and Michtom, J.I. A Structured Approach to Programming. Prentice-Hall, Englewood Cliffs, N.J., 1977.

Digital Library

Google Scholar

[47]

Indermark, K. On a class of schematic languages, Technical rep. 82, Inst. for Res. and Programming, Gesellschaft fur Mathematik und Datenverarbeitung mbH, Bonn, Germany, Nov. 1974.

Google Scholar

[48]

Jensen, R. W., and Tonies, C.C., Software Engineering. Prenticehall, Engelwood Cliffs, N.J., 1979.

Google Scholar

[49]

Kasai, T. Translatability of flowcharts into while programs, J. of Comptr. and Syst. Sciences 9, 2 (Oct. 1974), 177-195.

Google Scholar

[50]

Kleene, S.C., Introduction to Metamathematics. Van Nostrand Co., New York, 1952.

Google Scholar

[51]

Kleene, S.C. General recursive functions of natural numbers. Math. Annalan 112 (1936), 727-742.

Crossref

Google Scholar

[52]

Knuth, D.E. Structured programming with go to statements. Comptr. Surv. 6, 4 (Dec. 1974), 201-301.

Digital Library

Google Scholar

[53]

Knuth, D.E., and Floyd, R.W. Notes on avoiding "go to" statements. Inform. Processing Letters 1, (971), 23-31

Google Scholar

[54]

Kosaraju, S.R. Analysis of structured programs. J. of Comptr. and Syst. Sciences 9, (1974), 232-255.

Digital Library

Google Scholar

[55]

Kreczmar, A. Effectivity problems of algorithmic logic. In Annal. Soc. Math Pol. Series IV; Fundamenta Informaticae I, 1 (1977), 19- 32.

Google Scholar

[56]

Leavenworth, B.M. Programming with(out) the goto. SIGPLAN Notices (ACM) 7, 11 (Nov. 1972), 54-58; Proc. ACM Ann. Conf., Boston, 1972.

Digital Library

Google Scholar

[57]

Ledgard, H.F., and Marcotty, M. A genealogy of control structures. Comm. ACM 18, 11 (Nov. 1975), 629-639.

Digital Library

Google Scholar

[58]

Lee, R.C.T., and Chang, S.K. Structured programming and automatic program synthesis. SIGPLAN Notices (ACM) 9, 4 (April 1974), 60-70; Proc. symp. on Very High Level Languages, Santa Monica, Calif., March 1974.

Digital Library

Google Scholar

[59]

Linger, R.C., and Mills, H.D. On the development of large reliable programs. In Current Trends in Programming Methodology, Vol. 1. R.T. Yeh, Ed., Prentice-Hall, Englewood, Cliffs, N.J., 1977, pp. 120-139.

Google Scholar

[60]

Linger, R.C. Mills, H.D., and Witt, B.I. Structured Programming: Theory and Practice. Addison-Wesley, Reading, Mass., 1979.

Digital Library

Google Scholar

[61]

Martin, J.J. The "natural" set of basic control structures. SIGPLAN Notices (ACM) 8, 12 (Dec. 1973), 5-14.

Digital Library

Google Scholar

[62]

McGowan, C. Structured programming: A review of some practical concepts. Computer 8, 6 (1975) 25-30.

Digital Library

Google Scholar

[63]

McGowan, C. L., and Kelly, J.R. Top-Down Structured Programming Techniques. Petrocelli/Charter, New York, 1975.

Google Scholar

[64]

Merton, R.K. On the Shoulders of Giants: A Shandean Postscript. Harcourt, Brace and World, New York, 1965.

Google Scholar

[65]

Meyer, A.R., and Ritchie, D.M. The complexity of loop programs. IBM Res. Rep. rc-1817, 1966.

Google Scholar

[66]

Miller, E.F., Jr., and Lindamood, G.E. Structured programming: Top-down approach. Datamation 19, 12 (Dec. 1973), 55-57.

Google Scholar

[67]

Mills, H.D. Mathematical foundations for structured programming. IBM rep. FSC 72-6012, Fed. Syst. Div., Gaithersburg, Md., 1972.

Google Scholar

[68]

Mills, H.D. The new math of computer programming. Comm. ACM 18, 1 (Jan. 1975), 43-48.

Digital Library

Google Scholar

[69]

Mills, H.D. How to write correct programs and know it. Proc. IEEE Tutorial on Structured Programming, Washington, D.C., Sept. 1975, pp. 84-91.

Digital Library

Google Scholar

[70]

Mirkowska, G. Algorithmic logic and its applications. Doctoral diss. Univ. of Warsaw, 1972 (In Polish).

Google Scholar

[71]

Myers, G.J. Reliable Software through Composite Design. Van Nostrand Reinhold Co., New York, 1975.

Digital Library

Google Scholar

[72]

Myers, G.J. Composite/Structured Design. Van Nostrand Reinhold Co., New York, 1978.

Digital Library

Google Scholar

[73]

Nassi, L., and Shneiderman, B. Flowchart techniques for structured programming. SIGPLAN Notices (ACM) 8, 8 (Aug, 1973) 12-26.

Digital Library

Google Scholar

[74]

Neely, P.M. On program control structure. Proc. Ann. ACM Conf., Atlanta, Ga., 1973, pp. 119-125.

Digital Library

Google Scholar

[75]

Nicholls, J.E. The Structure and Design of Programming Languages. Addison-Wesley, Reading, Mass., 1975.

Digital Library

Google Scholar

[76]

Partch, B. Improved technology for application development management overview. Proc. SHARE XLI, Miami, Florida, Aug. 1973, pp. 1281-1300.

Google Scholar

[77]

Perkowska, E. Theorem on the normal form of a program. Bull. Acad. Pol. Sci., Ser. Sci. Math. Astr. Phys. 22, 4 (1974), 439-442.

Google Scholar

[78]

Peterson, W. W., Kasami, T., and Tokura, N. On the capabilities of while, repeat, and exit statements, Com. ACM 16, 8 (Aug. 1973), 503-512.

Digital Library

Google Scholar

[79]

Plum, T. W-S. Mathematical overkill and the structure theorem. SIGPLAN Notices (ACM) 10, 2 (Feb. 1975), 32-33.

Digital Library

Google Scholar

[80]

Prather, R.E. Structured Turing machines. Inform. and Control 35 (1977), 159-171.

Crossref

Google Scholar

[81]

Pratt, V.R. Semantical considerations on Floyd-Hoare logic. Proc. 17th Symp. on Foundations of Comptr. Sci., Houston, Texas, Oct. 1976, pp. 109-129.

Google Scholar

[82]

Rogers, H., Jr. Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.

Digital Library

Google Scholar

[83]

Tnuryn, J. Fixed-points and algebras with infinetly long expressions, part II mu-clones of regular algebras. Technical rep. 311, Inst. of Comptr. Sci. Polish. Acad. of Sci. 1978.

Google Scholar

[84]

Van Gelder. A Structured programming in COBOL. An approach for application programmers. Comm. ACM 20, 1 (Jan. 1977), 2-12.

Digital Library

Google Scholar

[85]

Wand. M. A concrete approach to abstract recursive definitions In Automata. Languages and Programmin. M. Nivat. Ed. North- Holland Pub. Co. Amsterdam, 1973, pp. 331-341.

Google Scholar

[86]

Wise, D.S. Foedman, D.P. Shapiro, S.C. and Wand, M. Boolean-valued loops BIT 15 (1975), 431-451.

Google Scholar

[87]

Wulf, W. A. A case against the goto. SIGPLAN Noticws (ACM) 7, 11 (Nov. 1972), 63-69, Proc. ACM Ann. Conf. Boston, 1972.

Digital Library

Google Scholar

[88]

Yourdon, E. Techniques of Program Structure and Design Prentice-Hall, Englewood Cliffs, N.J., 1975.

Digital Library

Google Scholar

[89]

Yourdon, E. Managing the Structured Techniques. Second edition, Yourdon Press, New York, 1979. (First edition, How to Manage Structure Programming. 1976).

Digital Library

Google Scholar

[90]

Yourdon, E. and Constantine. L.L. Structured Design Fundamentals of a Discipline of Computer Program and Systems Designs. Yourdon Press, New York, 1978.

Digital Library

Google Scholar

[91]

Zelkowitz, M.V., Shaw, A.C., and Gannon, J.D. Principles of Software Engineering and Design. Prentice-Hall, Englewood Cliffs. N.J., 1979.

Digital Library

Google Scholar

Cited By

View all

Ochigame R(2024)Automated mathematics and the reconfiguration of proof and laborBulletin of the American Mathematical Society10.1090/bull/182161:3(423-437)Online publication date: 15-May-2024
https://doi.org/10.1090/bull/1821
Nakamura Y(2024)Undecidability of the Positive Calculus of Relations with Transitive Closure and Difference: Hypothesis Elimination Using Graph LoopsRelational and Algebraic Methods in Computer Science10.1007/978-3-031-68279-7_13(207-224)Online publication date: 19-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68279-7_13
Yu N(2023)Structured Theorem for Quantum Programs and its ApplicationsACM Transactions on Software Engineering and Methodology10.1145/358715432:4(1-35)Online publication date: 26-May-2023
https://dl.acm.org/doi/10.1145/3587154
Show More Cited By

Recommendations

Structured programming in Cobol: an approach for application programmers

Techniques for designing and writing Cobol programs are presented. Previous work in structured programming is drawn upon and adapted. The presentation is informal: the terminology is nonmathematical as far as possible, no theorems are proved, and ...
Fundamentals of reversible flowchart languages

This paper presents the fundamentals of reversible flowcharts. Reversible flowcharts are intended to naturally represent the structure and control flow of reversible (imperative) programming languages in a simple computation model in the same way ...
Structured flowcharts for multiprocessing

We present a flowchart language for parallel processing: in addition to the ''standard'' components, our flowcharts contain fork, join and synchronizing nodes. Extending the work of Mills, we suggest restrictions on controlling computation flow and show ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 23, Issue 7

July 1980

45 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/358886

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1980

Published in CACM Volume 23, Issue 7

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

82
Total Citations
View Citations
1,372
Total Downloads

Downloads (Last 12 months)174
Downloads (Last 6 weeks)35

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ochigame R(2024)Automated mathematics and the reconfiguration of proof and laborBulletin of the American Mathematical Society10.1090/bull/182161:3(423-437)Online publication date: 15-May-2024
https://doi.org/10.1090/bull/1821
Nakamura Y(2024)Undecidability of the Positive Calculus of Relations with Transitive Closure and Difference: Hypothesis Elimination Using Graph LoopsRelational and Algebraic Methods in Computer Science10.1007/978-3-031-68279-7_13(207-224)Online publication date: 19-Aug-2024
https://dl.acm.org/doi/10.1007/978-3-031-68279-7_13
Yu N(2023)Structured Theorem for Quantum Programs and its ApplicationsACM Transactions on Software Engineering and Methodology10.1145/358715432:4(1-35)Online publication date: 26-May-2023
https://dl.acm.org/doi/10.1145/3587154
Rojas RRojas R(2023)How to Make Zuse’s Z3 a Universal ComputerKonrad Zuse's Early Computers10.1007/978-3-031-39876-6_6(113-117)Online publication date: 14-Oct-2023
https://doi.org/10.1007/978-3-031-39876-6_6
Lamport L(2022)Deconstructing the bakery to build a distributed state machineCommunications of the ACM10.1145/351325965:9(58-66)Online publication date: 19-Aug-2022
https://dl.acm.org/doi/10.1145/3513259
Lorås MSindre GTrætteberg HAalberg T(2021)Study Behavior in Computing Education—A Systematic Literature ReviewACM Transactions on Computing Education10.1145/346912922:1(1-40)Online publication date: 18-Oct-2021
https://dl.acm.org/doi/10.1145/3469129
McColl CEstivill-Castro VGilmore EMcColl MHexel R(2021)Enabling Modern Application Development with Swift on the Nao/Pepper RobotsRoboCup 2021: Robot World Cup XXIV10.1007/978-3-030-98682-7_2(15-27)Online publication date: 22-Jun-2021
https://dl.acm.org/doi/10.1007/978-3-030-98682-7_2
Letan TRégis-Gianas YBlanchette JHriţcu C(2020)FreeSpec: specifying, verifying, and executing impure computations in CoqProceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3372885.3373812(32-46)Online publication date: 20-Jan-2020
https://dl.acm.org/doi/10.1145/3372885.3373812
Huntsman SRobinson M(2020)The Geometry of Syntax and Semantics for Directed File Transformations2020 IEEE Security and Privacy Workshops (SPW)10.1109/SPW50608.2020.00062(284-290)Online publication date: May-2020
https://doi.org/10.1109/SPW50608.2020.00062
Wang Ode Sainte Marie CKe CLiberti L(2018)Universality and prediction in business rulesComputational Intelligence10.1111/coin.1217434:2(763-785)Online publication date: 30-Apr-2018
https://doi.org/10.1111/coin.12174
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Recommendations

Structured programming in Cobol: an approach for application programmers

Fundamentals of reversible flowchart languages

Structured flowcharts for multiprocessing

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations