Predicting Subsystem Defects using Dependency Graph Complexities

Thomas Zimmermann and Nachiappan Nagappan

Abstract

n 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.

Details

Publication typeInproceedings
Published inProceedings of the 18th IEEE International Symposium on Software Reliability Engineering (ISSRE)
Pages227-236
PublisherIEEE Computer Society
> Publications > Predicting Subsystem Defects using Dependency Graph Complexities