Identifying 'Linchpin Vertices' that Cause Large Dependence Clusters

David Binkley; Mark Harman

doi:10.1109/SCAM.2009.18

Identifying 'Linchpin Vertices' that Cause Large Dependence Clusters

David Binkley, Mark Harman

King's College London

Research output: Chapter in Book/Report/Conference proceeding › Conference paper

14 Citations (Scopus)

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 that a large cluster can be caused by the smallest atomic unit source code: a single vertex or edge of the program's dependence graph. These are termed the linchpin vertices and edges in this paper.

Original language	English
Title of host publication	Unknown
Place of Publication	LOS ALAMITOS
Publisher	IEEE COMPUTER SOC
Pages	89 - 98
Number of pages	10
ISBN (Print)	978-0-7695-3793-1
DOIs	https://doi.org/10.1109/SCAM.2009.18
Publication status	Published - 2009
Event	9th IEEE International Working Conference on Source Code Analysis and Manipulation - Edmonton, Canada Duration: 20 Sept 2009 → 21 Sept 2009

Publication series

Name	2009 NINTH IEEE INTERNATIONAL WORKING CONFERENCE ON SOURCE CODE ANALYSIS AND MANIPULATION, PROCEEDINGS

Conference

Conference	9th IEEE International Working Conference on Source Code Analysis and Manipulation
Country/Territory	Canada
City	Edmonton
Period	20/09/2009 → 21/09/2009

Access to Document

10.1109/SCAM.2009.18

Cite this

@inbook{a10b2fd65ce045acb57329d1ceac37bf,

title = "Identifying 'Linchpin Vertices' that Cause Large Dependence Clusters",

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 that a large cluster can be caused by the smallest atomic unit source code: a single vertex or edge of the program's dependence graph. These are termed the linchpin vertices and edges in this paper.",

author = "David Binkley and Mark Harman",

year = "2009",

doi = "10.1109/SCAM.2009.18",

language = "English",

isbn = "978-0-7695-3793-1",

series = "2009 NINTH IEEE INTERNATIONAL WORKING CONFERENCE ON SOURCE CODE ANALYSIS AND MANIPULATION, PROCEEDINGS",

publisher = "IEEE COMPUTER SOC",

pages = "89 -- 98",

booktitle = "Unknown",

note = "9th IEEE International Working Conference on Source Code Analysis and Manipulation ; Conference date: 20-09-2009 Through 21-09-2009",

}

Binkley, D & Harman, M 2009, Identifying 'Linchpin Vertices' that Cause Large Dependence Clusters. in Unknown. 2009 NINTH IEEE INTERNATIONAL WORKING CONFERENCE ON SOURCE CODE ANALYSIS AND MANIPULATION, PROCEEDINGS, IEEE COMPUTER SOC, LOS ALAMITOS, pp. 89 - 98, 9th IEEE International Working Conference on Source Code Analysis and Manipulation, Edmonton, Canada, 20/09/2009. https://doi.org/10.1109/SCAM.2009.18

TY - CHAP

T1 - Identifying 'Linchpin Vertices' that Cause Large Dependence Clusters

AU - Binkley, David

AU - Harman, Mark

PY - 2009

Y1 - 2009

N2 - 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 that a large cluster can be caused by the smallest atomic unit source code: a single vertex or edge of the program's dependence graph. These are termed the linchpin vertices and edges in this paper.

AB - 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 that a large cluster can be caused by the smallest atomic unit source code: a single vertex or edge of the program's dependence graph. These are termed the linchpin vertices and edges in this paper.

UR - http://www.scopus.com/inward/record.url?scp=72349087990&partnerID=8YFLogxK

U2 - 10.1109/SCAM.2009.18

DO - 10.1109/SCAM.2009.18

M3 - Conference paper

SN - 978-0-7695-3793-1

T3 - 2009 NINTH IEEE INTERNATIONAL WORKING CONFERENCE ON SOURCE CODE ANALYSIS AND MANIPULATION, PROCEEDINGS

SP - 89

EP - 98

BT - Unknown

PB - IEEE COMPUTER SOC

CY - LOS ALAMITOS

T2 - 9th IEEE International Working Conference on Source Code Analysis and Manipulation

Y2 - 20 September 2009 through 21 September 2009

ER -

Identifying 'Linchpin Vertices' that Cause Large Dependence Clusters

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this