We develop a control flow analysis algorithm for PCF based on game semantics. The analysis is closely related to Shivers' 0-CFA analysis and the algorithm is shown to be cubic. The game semantics basis for the algorithm means that it can be naturally extended to handle strict languages and languages with imperative features. These extensions are discussed in the paper. We sketch the correctness proof for the algorithm. We also illustrate an algorithm for computing k-limited CFA.

Interpretation Perspective Patrick Cousot Program Analysis Position Statement: ffl Semantic analysis (of programs, systems, etc.) should become a mature discipline to be included in educational curricula in computer science; ffl This requires the discipline to evolve from an illassorted collection of methods and algorithms to a large scope formal reasoning and design methodology; ffl In particular, program analysis methods should be explained in language, program encoding, semantics, property, property encoding, and approximation independent way, to be of very broad scope and wide usefulness; ffl This might be possible by reasoning on the approximation of the structures involved in semantical specifications; ffl This effort would culminate in a general theory of semantical approximation leading to a tractable composable parameterized semantical analysis design methodology; ffl From a more practical point of view, the methodology would be applied to the uniform design of: --...

Interpretation Perspective Patrick Cousot Program Analysis Position Statement: ffl Semantic analysis (of programs, systems, etc.) should become a mature discipline to be included in educational curricula in computer science; ffl This requires the discipline to evolve from an illassorted collection of methods and algorithms to a large scope formal reasoning and design methodology; ffl In particular, program analysis methods should be explained in language, program encoding, semantics, property, property encoding, and approximation independent way, to be of very broad scope and wide usefulness; ffl This might be possible by reasoning on the approximation of the structures involved in semantical specifications; ffl This effort would culminate in a general theory of semantical approximation leading to a tractable composable parameterized semantical analysis design methodology; ffl From a more practical point of view, the methodology would be applied to the uniform design of: --...