Journal of Jilin University(Information Science Ed ›› 2014, Vol. 32 ›› Issue (1): 47-55.

Previous Articles     Next Articles

Improved C Program Slicing Algorithm Based on Reverse Flow Analysis

LI Bing-yu1a,2, LvShuai1a,1b,1c, HE Li-li1a   

  1. 1a. College of Computer Science and Technology;  1b. Key Laboratory of Symbolic Computation and Knowledge Engineering,Ministry of Education; 1c. College of Mathematics, Jilin University, Changchun 130012, China;2. Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China
  • Received:2013-08-16 Online:2014-01-24 Published:2014-04-03

Abstract:

An improved static slicing algorithm based on reverse flow has been put porward, to solve the disadvantage of traditional slicing algorithm that spends too much time and space. The improved algorithm only by analyzing the control dependence, to obtain the overall framework of the program, then scanning from inside to outside in the way of expanding based on reverse flow of control starting from the slicing point, continually gaining data dependence associated only with the slices, followed by analysis of the program slicing. This makes the algorithm not only solve the shortcomings of the traditional slicing algorithms, but also reduce the workload of the calculation control flow, eliminating the need to calculate the predicate dependency set, to further improve the efficiency of the slices, to reduce the w
aste of resources.

Key words: program slicing, static slicing, control dependence, data dependence, reverse flow

CLC Number: 

  • TP31