Identifying 'Linchpin Vertices' That Cause Large Dependence Clusters

Authors:
David Binkley;Mark Harman
Affiliations:
-;-
Venue:
SCAM '09 Proceedings of the 2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation
Year:
2009

Citing 0
Cited 4

Coherent dependence clusters

Proceedings of the 9th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Dependence cluster visualization

Proceedings of the 5th international symposium on Software visualization
Efficient Identification of Linchpin Vertices in Dependence Clusters

ACM Transactions on Programming Languages and Systems (TOPLAS)
Coherent clusters in source code

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

A dependence cluster is a maximal set of program components that all depend upon one another. Previous work has highlighted the prevalence of large dependence clusters in source code, presenting potential problems for comprehension, testing, and maintenance.This paper is concerned with source code analysis techniques for identifying the causes of large dependence clusters. The paper presents results of a study of low-level causes of dependence clusters, which reveals thata large cluster can be caused by the smallest atomic unit source code: a single vertex or edge of the program'sdependence graph. These are termed the linchpin vertices and edges in this paper.