Efficient Identification of Linchpin Vertices in Dependence Clusters

@article{Binkley2013EfficientIO,
  title={Efficient Identification of Linchpin Vertices in Dependence Clusters},
  author={David W. Binkley and Nicolas E. Gold and Mark Harman and Syed S. Islam and Jens Krinke and Zheng Li},
  journal={ACM Trans. Program. Lang. Syst.},
  year={2013},
  volume={35},
  pages={7:1-7:35}
}
Several authors have found evidence of large dependence clusters in the source code of a diverse range of systems, domains, and programming languages. This raises the question of how we might efficiently locate the fragments of code that give rise to large dependence clusters. We introduce an algorithm for the identification of linchpin vertices, which hold together large dependence clusters, and prove correctness properties for the algorithm’s primary innovations. We also report the results of… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS
2 Citations
5 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Similar Papers

Loading similar papers…