基于时序逻辑证明编译优化程序变换的保义性  

Proving Soundness of Program Transformations in Optimizing Compilation Based on Temporal Logic

作　　者：陶秋铭[1,2] 赵琛[1,3] 郭亮[3] 

机构地区：[1]中国科学院软件研究所互联网软件技术实验室,北京100190 [2]中国科学院研究生院,北京100049 [3]中国科学院软件研究所基础软件国家工程研究中心,北京100190

出　　处：《软件学报》2009年第8期2074-2086,共13页Journal of Software

基　　金：国家自然科学基金No.60573164;国家高技术研究发展计划(863)No.2006AA010201~~

摘　　要：基于时序逻辑CTL(computation tree logic)的一种扩展CTL-FV对优化编译中的语句交换和变量替换这两种常见变换的保义性条件给出了形式刻画,采用含条件重写规则定义了保义语句交换Texch和保义变量替换Tsub,并基于一种归纳证明框架对它们的保义性进行了证明.此外,基于变换Texch对程序基本块内保依赖语句重排的保义性也给出了一种构造性的证明.Two kinds of program transformations widely-used in optimizing compilation, statement exchange and variable substitution, are investigated and their soundness conditions are formally defined with CTL-FV, an extension of the temporal logic CTL （computation tree logic）. Sound statement exchange Texch and sound variable substitution Texch are defined with conditioned rewriting rules and their soundness is proved under an inductive proof frame. In addition, based on Texch, the soundess of another transformation, dependence-preserving statement reordering inside basic blocks of programs, is also proved with a constructive method.

关 键 词：时序逻辑 形式规约 优化编译 程序变换 语句交换 变量替换 语句重排 

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