命令式语言的精确约束时间分析(英文)  

Accurate Binding Time Analysis for Imperative Languages

作　　者：王明文[1] 孙永强[2] 

机构地区：[1]江西师范大学计算机科学技术学院,江西南昌330027 [2]上海交通大学计算机科学与工程系,上海200030

出　　处：《江西师范大学学报（自然科学版）》2001年第1期29-35,82,共8页Journal of Jiangxi Normal University(Natural Science Edition)

基　　金：Thisworkissupportedinpartby 86 3Project (86 3 30 6 )ofChinaandFoundationofNa tionalNatureScienceofChina (6 99830 0 3) .

摘　　要：构造程序语言的部分计值器时最重要的一步是约束时间分析 .当已知程序的部分输入时 ,约束时间分析阶段是区分程序中哪些计算可在部分计值时完成 ,哪些计算须在运行时完成 .然而对实际应用程序 ,已存在的部分计值器并没有较好对程序进行优化得到执行效率高的剩余程序 ,其主要原因是对程序没有精确提取约束时间分析信息 .该文作者应用与前人不同的方法 ,将约束时间分析分为 3个阶段 :约束时间、递归调用分析、相关性分析 ,通过各阶段分析以提取更精确的约束时间分析信息 ,从而得到高效率的剩余程序 .此外 ,该文提供了相应程序变换规则 ,分析各个程序的子结构模块 ,在例化时完成相应计算并生成剩余程序 .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 binding time information of the program's initial argument is given. However, we have discovered that existing partial evaluation technology can not effectively specialize existing realistic programs. This is due to that they are lack of accuracy of 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, separate the different tasks performed by a binding time analysis into three distinct phases: binding time phase, recursive call analysis phase and sensitivity analysis phase. This separation simplifies the design of the analysis. Additionally, this approach allows us to express new program transformations, such as evaluating and residualizing the same program construct.

关 键 词：部分计值 约束时间分析 递归归约树 命令式语言 程序变换规则 递归调用分析 剩余程序 

分 类 号：TP311.11[自动化与计算机技术—计算机软件与理论]