DocumentCode
492611
Title
Predicting defects using network analysis on dependency graphs
Author
Zimmermann, Thomas ; Nagappan, Nachiappan
Author_Institution
Univ. of Calgary, Calgary, AB
fYear
2008
fDate
10-18 May 2008
Firstpage
531
Lastpage
540
Abstract
In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience backed by code complexity metrics. But often dependencies exist between various pieces of code over which managers may have little knowledge. These dependencies can be construed as a low level graph of the entire system. In this paper, we propose to use network analysis on these dependency graphs. This allows managers to identify central program units that are more likely to face defects. In our evaluation on Windows Server 2003, we found that the recall for models built from network measures is by 10% points higher than for models built from complexity metrics. In addition, network measures could identify 60% of the binaries that the Windows developers considered as critical-twice as many as identified by complexity metrics.
Keywords
software metrics; software quality; Windows developers; central program units; code complexity metrics; defects prediction; dependency graphs; network analysis; quality assurance; resources allocation; software development; Costs; Engineering management; Network servers; Permission; Predictive models; Quality assurance; Quality management; Resource management; Software engineering; Software measurement; defect prediction; dependency graph; network analysis; windows server 2003;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering, 2008. ICSE '08. ACM/IEEE 30th International Conference on
Conference_Location
Leipzig
ISSN
0270-5257
Print_ISBN
978-1-4244-4486-1
Electronic_ISBN
0270-5257
Type
conf
DOI
10.1145/1368088.1368161
Filename
4814164
Link To Document