This is the authors' abstract. We don't add key points for this paper.
Any static, global analysis of the expression and data relationships in a program requires a knowledge of the control flow of the program. Since one of the primary reasons for doing such a global analysis in a compiler is to produce optimized programs, control flow analysis has been embedded in many compilers and has been described in several papers. An early paper by Prosser [5] described the use of Boolean matrices (or, more particularly, connectivity matrices) in flow analysis. The use of “dominance” relationships in flow analysis was first introduced by Prosser and much expanded by Lowry and Medlock [6]. References [6,8,9] describe compilers which use various forms of control flow analysis for optimization. Some recent developments in the area are reported in [4] and in [7].
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Frances Allen (1970) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: