Analyzing dependence locality for efficient construction of program dependence graph
A program dependence graph (PDG) is used for computing program slices. To construct a PDG, we need dependency analysis of statements, which is very expensive in terms of memory space and computation time. In order to increase the efficiency of this analysis, we propose an algorithm for constructing a PDG in which several statements share their dependency information. In order not to degrade the precision of the resulting slice, we investigate the dependency locality of statements to be shared. The effectiveness of this approach has been investigated. Our experimental results show that the space utility decreased by 6.7249.79% and the analysis time decreased by 4.1433.21%. Also, a criterion on the locality of statement merging has been studied.
program dependence graph program slice