Applications of high level control flow

ABSTRACT

Control flow relations in a high level language program can be represented by a hierarchy of small graphs that combines nesting relations among statements in an ALGOL-like syntax with relevant perturbations caused by goto or leave statements. Applications of the new style of representation include denotational semantics, data flow analysis, source level compiler diagnostics, and program proving.

REFERENCES

• 1: J. Lawrence Carter, A case study of a new code generation technique for compilers, Communications of the ACM, v.20 n.12, p.914-920, Dec. 1977 [doi>10.1145/359897.359902]
• 2: CH72. Clint, M., and Hoare, C. A. R. Program proving: jumps and functions. Acta Informatica1 (1972), 214-224.
• 3: Ole Johan Dahl, Structured Programming, Academic Press, Inc., Orlando, FL, 1972
• 4: R. A. DeMillo , S. C. Eisenstat , R. J. Lipton, Can structured programs be efficient?, ACM SIGPLAN Notices, v.11 n.10, p.10-18, October 1976 [doi>10.1145/956020.956021]
• 5: F167. Floyd, R. W. Assigning meanings to programs. Proc. Symp. Appl. Math. 19 (1967), 19-32.
• 6: FO76. Fosdick, L. D., and Osterweil, L. J. Data flow analysis in software reliability. TR CU-CS-087-76, Computer Science Dept., University of Colorado, Boulder, May 1976.
• 7: Susan L. Graham , Mark Wegman, A Fast and Usually Linear Algorithm for Global Flow Analysis, Journal of the ACM (JACM), v.23 n.1, p.172-202, Jan. 1976 [doi>10.1145/321921.321939]
• 8: William Harrison, A new strategy for code generation: the general purpose optimizing compiler, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.29-37, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512954]
• 9: HU75. Hecht, M. S., and Ullman, J. D. A simple algorithm for global flow data flow problems. SIAM J. Computing4 (1975), 519-532.
• 10: C. A. R. Hoare, An axiomatic basis for computer programming, Communications of the ACM, v.12 n.10, p.576-580, Oct. 1969 [doi>10.1145/363235.363259]
• 11: John B. Kam , Jeffrey D. Ullman, Global Data Flow Analysis and Iterative Algorithms, Journal of the ACM (JACM), v.23 n.1, p.158-171, Jan. 1976 [doi>10.1145/321921.321938]
• 12: Donald E. Knuth, Structured Programming with go to Statements, ACM Computing Surveys (CSUR), v.6 n.4, p.261-301, Dec. 1974 [doi>10.1145/356635.356640]
• 13: Henry F. Ledgard , Michael Marcotty, A genealogy of control structures, Communications of the ACM, v.18 n.11, p.629-639, Nov. 1975 [doi>10.1145/361219.361222]
• 14: David B. Loveman, Program improvement by source to source transformation, Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.140-152, January 19-21, 1976, Atlanta, Georgia [doi>10.1145/800168.811548]
• 15: Zohar Manna, Introduction to Mathematical Theory of Computation, McGraw-Hill, Inc., New York, NY, 1974
• 16: MR76. Markowsky, G., and Rosen, B. K. Bases for chain-complete posets. IBM J. Res. and Devel.20 (1976), 138-147.
• 17: OF76. Osterweil, L. J., and Fosdick, L. D. DAVE: a validation, error detection, and documentation system for FORTRAN programs. Software Practice and Experience (1976) to appear.
• 18: Susan S. Owicki, Axiomatic Proof Techniques for Parallel Programs, Cornell University, Ithaca, NY, 1975
• 19: Susan Owicki, A consistent and complete deductive system for the verification of parallel programs, Proceedings of the eighth annual ACM symposium on Theory of computing, p.73-86, May 03-05, 1976, Hershey, Pennsylvania, United States [doi>10.1145/800113.803634]
• 20: Susan Owicki , David Gries, Verifying properties of parallel programs: an axiomatic approach, Communications of the ACM, v.19 n.5, p.279-285, May 1976 [doi>10.1145/360051.360224]
• 21: Ro76a. Rosen, B. K. Correctness of parallel programs: the Church-Rosser approach. Theoretical Computer Science2 (1976), 183-207.
• 22: Ro76b. Rosen, B. K. Data flow analysis for procedural languages. IBM Research Report RC 5948, Yorktown Heights, April 1976.
• 23: Barry K. Rosen, High-level data flow analysis, Communications of the ACM, v.20 n.10, p.712-724, Oct. 1977 [doi>10.1145/359842.359849]
• 24: Sp76. Spier, M. J. Software malpractice --- a distasteful experience. Software Practice and Experience6 (1976), 293-299.
• 25: SW74. Strachey, C., and Wadsworth, C. P. Continuations: a mathematical semantics for handling full jumps. Tech. Mono. PRG-11, Programming Res. Grp., Oxford U., January 1974.
• 26: Ul73. Ullman, J. D. Fast algorithms for the elimination of common subexpressions. Acta Informatica2 (1973), 191-213.
• 27: Wa76. Wang, A. An axiomatic basis for proving total correctness of goto programs. BIT16 (1976), 88-102.
• 28: William Allan Wulf , Richard K. Johnsson , Charles B. Weinstock , Steven O. Hobbs , Charles M. Geschke, The Design of an Optimizing Compiler, Elsevier Science Inc., New York, NY, 1975
• 29: Charles T. Zahn, Jr., A control statement for natural top-down structured programming, Programming Symposium, Proceedings Colloque sur la Programmation, p.170-180, April 09-11, 1974