Abstract: The dynamic nature of pointers makes a pointer possibly points to many different locations in an execution in program analysis. hhe existing dependence graph construction algorithms have already taken these multiple points-to relations into consideration. However, they do not consider the combination of points-to relations. Many points-to relations are not combinable. Without excluding these invalid combinations,we may lose precision in dependence graph construction. To address the problem, this paper proposed an approach that uses the invalid combinations of points to relations to optimize dependence graph construction. The approach can discard many false dependences which cannot be identified by the existing approaches, and thereby improve the precision of dependence graph construction.

Key words: Dependence graph, Pointer, Combination, Alias, Program slicing