Some directed graph algorithms and their application to pointer analysis

@inproceedings{Pearce2005SomeDG,
  title={Some directed graph algorithms and their application to pointer analysis},
  author={David James Pearce},
  year={2005}
}
This thesis is focused on improving execution time and precision of scalable pointer analysis. Such an analysis statically determines the targets of all pointer variables in a program. We formulate the analysis as a directed graph problem, where the solution can be obtained by a computation similar, in many ways, to transitive closure. As with transitive closure, identifying strongly connected components and transitive edges offers significant gains. However, our problem differs as the… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

Similar Papers

Loading similar papers…