2003 · 10 citations · 27 references
ComputingComputer EngineeringComputer ScienceAlgorithmsCompilersTheory Of ComputationControl-flow AnalysisData-flow AnalysisDynamic ProgrammingRegister AllocationStatic AnalysisStatic Code AnalysisControl Flow Graph AnalysisControl Flow GraphsControl-flow Graph ConstructionDead Code Analysis
flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed point is commonly computed through an iterative procedure that repeats tracing until convergence.
27
Graph minors. II. Algorithmic aspects of tree-width
Neil Robertson, Paul Seymour · Journal of Algorithms · 1986 · 1.5K citations
Register allocation & spilling via graph coloring
Gregory J. Chaitin · ACM SIGPLAN Notices · 1982 · 767 citations · Full text
Frances Allen · ACM SIGPLAN Notices · 1970 · 720 citations
An empirical study of FORTRAN programs
Donald E. Knuth · Software Practice and Experience · 1971 · 682 citations