摘要
对于广泛的软件维护和测试任务而言,控制依赖信息是很有用的。软件工程中控制依赖通常用来确定一条程序语句语义的变化是否影响其它程序语句的执行。控制依赖是在图论的后必经概念的基础上定义的,控制依赖关系的标准表示是控制依赖图(CDG)。论文着重介绍了一种计算过程内控制依赖的算法,并分析了该算法的时间和空间复杂度。
Control dependence information is useful for a wide range of software maintenance and testing tasks.The most common use of control dependence in software engineering is in determining whether a change to the semantics of a program statement affects the execution of another program statement.Control dependence is based on the graph-theo-retic concept of postdominance.The standard representation of control dependece relation is control dependence graph(CDG).In this paper,emphasis is laid on introduing an algorithm for computing intraprocedural control dependence,and finally its time and space complexity are analyzed.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第22期78-80,共3页
Computer Engineering and Applications
基金
国家部委预研基金资助
