Invariance of Approximate Semantics with Respect to Program Transformations
暂无分享,去创建一个
Program transformations, as used for optimization and sometimes for program development, utilize information about the program which is derived by the method of abstract interpretation within various data flow analysis frameworks. Each transformation, as it changes the program, may render the flow information derived for the original program suboptimal or even invalid with respect to the new program. Although the outdated flow information may serve well as a starting point for rederivation, it appears profitable to look for conditions where passes of many transformations may be performed without recalculating flow information each time a transformation rule is applied.
[1] Robert Giegerich,et al. Automatische Erzeugung von Maschinencode-Optimierern , 1981 .
[2] Matthew S. Hecht,et al. Flow Analysis of Computer Programs , 1977 .
[3] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[4] Alfred V. Aho,et al. Principles of Compiler Design , 1977 .
[5] Patrick Cousot,et al. Systematic design of program analysis frameworks , 1979, POPL.