Global data flow analysis by decomposition into primes

The concept of prime program is applied as a decomposition technique to the global data flow analysis problem. This is done both in the abstract and through the use of the live variables problem as an example. It is also shown how the prime program decomposition is equivalent to the arrangement of a certain matrix (associated with the global data flow analysis problem) into block triangular form.

[1]  Donald E. Knuth,et al.  Structured Programming with go to Statements , 1974, CSUR.

[2]  John Cocke,et al.  A program data flow analysis procedure , 1976, CACM.

[3]  Roy Alejandro Maddux,et al.  A study of computer program structure. , 1975 .

[4]  Anas N. Al-Rabadi,et al.  A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions , 2004 .

[5]  Harlan D. Mills,et al.  Structured programming - theory and practice , 1979, The systems programming series.

[6]  Edsger W. Dijkstra,et al.  Letters to the editor: go to statement considered harmful , 1968, CACM.

[7]  Matthew S. Hecht,et al.  Flow Analysis of Computer Programs , 1977 .

[8]  Robert E. Tarjan.  Prime subprogram parsing of a program , 1980, POPL '80.

[9]  Robert E. Tarjan,et al.  A Unified Approach to Path Problems , 1981, JACM.

[10]  Barry K. Rosen,et al.  High-level data flow analysis , 1977, CACM.

[11]  Harlan D. Mills,et al.  Mathematical foundations of structured programming , 1972 .

[12]  Michael Marcotty,et al.  A genealogy of control structures , 1975, CACM.

[13]  Jeffrey M. Barth.  A practical interprocedural data flow analysis algorithm , 1978, CACM.

[14]  Mark N. Wegman,et al.  A Fast and Usually Linear Algorithm for Global Flow Analysis , 1976, J. ACM.

[15]  Carlo Ghezzi,et al.  Augmenting Parsers to Support Incrementality , 1980, JACM.

[16]  E. S. Lee,et al.  Compiler design for efficient code generation and program optimization , 1979, SIGPLAN '79.

[17]  Edsger W. Dijkstra,et al.  Go To Statement Considered Harmful , 2022, Software Pioneers.

[18]  Gary A. Kildall,et al.  A unified approach to global program optimization , 1973, POPL.

[19]  Ken Kennedy,et al.  Graph grammars and global program data flow analysis , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[20]  Ira Richard Forman.  On the decomposition of programs into primes , 1979 .

[21]  Jeffrey D. Ullman,et al.  Global Data Flow Analysis and Iterative Algorithms , 1976, J. ACM.