Fast algorithms for Dyck-CFL-reachability with applications to alias analysis

@inproceedings{Zhang2013FastAF,
  title={Fast algorithms for Dyck-CFL-reachability with applications to alias analysis},
  author={Qirun Zhang and Michael R. Lyu and Hao Yuan and Zhendong Su},
  booktitle={PLDI '13},
  year={2013}
}
The context-free language (CFL) reachability problem is a well-known fundamental formulation in program analysis. In practice, many program analyses, especially pointer analyses, adopt a restricted version of CFL-reachability, Dyck-CFL-reachability, and compute on edge-labeled bidirected graphs. Solving the all-pairs Dyck-CFL-reachability on such bidirected graphs is expensive. For a bidirected graph with n nodes and m edges, the traditional dynamic programming style algorithm exhibits a… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

Citations

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

References

Publications referenced by this paper.
Showing 1-10 of 11 references

On economic construction of the transitive closure of a directed graph

  • V. Arlazarov, E. Dinic, M. Kronrod, I. Faradzev
  • Soviet Mathematics Doklady,
  • 1970
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…