We present a flow-sensitive interprocedural constant propagation algorithm, which sttpports recursion while only performing one flow-sensitive analysis of each procedure. We present experimental results which show that this method finds substantially more constants than previous methods andisefficient in practice. Reintroduce new metrics for evaluating interprocedural constant propagation algorithms which measurethe number of interprocedural constant values that are propagated. We usethese metrics to provide further experimental results for our algorithm.
Paul R. Carini, Michael Hind