A new fast algorithm for interprocedural static slicing

Abstract:

The data dependences irrelevant to program slicing should be calculated in traditional static program slicing algorithms based on PDG and SDG. To deal with this problem, a new fast algorithm for interprocedural static slicing is proposed in this paper, in which the program is represented as idUCF 5-tuple structure according to TOKEN and the information about control-flow of compound statement, and the interprocedural static slicing is calculated without using of intermediate representation of program, such as PDG and SDG. Experimental results show that the proposed method takes the information about function call into full account, reduces time and space complexity and ensures the integrity of static slicing for program with multi-nested structure. The algorithm only calculates the data dependence, control dependence and function call relevant to slicing. Thus, it has a low computation complexity.