Accurate Binding Time Analysis for Imperative Languages

摘要

The most important phase of partial evaluation is the binding time analysis, BTA, which works ahead to distinguish those computations which can be computed in partial evaluation time from which should be left to the running time, when the program's initial arguments are given. However, we have discovered that existing partial evaluation technology is not sufficient to effectively specialize existing realistic programs. This is due to that are lack of accurate binding time analysis in dealing with typical features of imperative programs. In this paper, we introduce an approach that fundamentally differs from previous work in several respects, including: Three-phase binding time analysis, Program transformations.