System Dependency Graph Construction Algorithm Based on Equivalent Substitution

There are many remarkable methods used in software semantics analysis. However, people find some of the methods generally have the common problem of high time complexity or inaccurate results. In order to solve these problems, we propose a program controlled flow algorithm which is based on a control dependency graph and an abstract syntax tree. This algorithm uses object program equivalent substitution and a procedure of dependency graph to replace procedure System Dependency Graph (SDG), which improves the building process of traditional system dependency graph. Experimental results show that the proposed algorithm can effectively reduce the complexity of constructional SDG and increase the rate of program slicing.