摘要
本文提出了一种通用的全局数据流分析新方法及相应的算法,并给出了该算法的时间复杂性分析及其正确性证明。与[6]相比,本文提出的算法无须构造颇费时空的包扎多图,且其时间复杂性是线性的。
This paper puts forward a new method and a corresponding algorithm used for a general - purpose global data -flow analysis, and gives the time complexity analysis and the correctness proof of the algorithm. Compared with the literature [6], the algorithm in this paper needs not to construct the binding multi - graph which consumes both time and space, and its time complexity is linear.
出处
《小型微型计算机系统》
CSCD
北大核心
1993年第6期50-56,共7页
Journal of Chinese Computer Systems
基金
国家教委博士点基金
航天基金
关键词
数据流分析
相关性分析
Data-flow analysis Dependence analysis
