Previous    Next


G¨odel [1931] proved the full employment theorem for mathematicians. Turing [1937] proved that the halting problem is undecidable, and Rice [1953] proved the full employment theorem for compiler writers, even before there were any compiler writers. Ershov [1958] developed value numbering. Allen [1969] codified many program optimizations; Allen [1970] and Cocke [1970] designed the first global dataflow analysis algorithms. Kildall [1973] first presented the fixed-point iteration method for dataflow analysis.

Landi and Ryder [1992] give an algorithm for interprocedural alias analysis.

JaVaScreenshot Previous    Next