Predicting order of likelihood of defective software modules

Rattikorn Hewett, Phongphun Kijsanayothin, Alta Van Dermerwe

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The ability to quickly identify defective software modules can help expedite development of dependable software. Much empirical research has focused on accurate prediction of defective modules from data of software previously developed under similar environments. While this is useful, time wasted on investigating wrong modules can be critical when dealing with extremely large and complex systems. Is it possible to rank predicted modules in order of their susceptibility to defectiveness? Unfortunately, the likelihood of defectiveness is neither entirely dependent on nor linear to the number of defects in software modules. This paper presents an algorithm for predicting if a newly developed software module is likely to be defective, and rank those predicted to be defective in order of their likelihood. We apply the algorithm to five benchmarked data sets of NASA software application projects. The experiments show highly competitive results to other well-established approaches giving an average of 85.3% accuracy.

Original languageEnglish
Title of host publication19th International Conference on Software Engineering and Knowledge Engineering, SEKE 2007
Pages93-98
Number of pages6
StatePublished - 2007
Event19th International Conference on Software Engineering and Knowledge Engineering, SEKE 2007 - Boston, MA, United States
Duration: Jul 9 2007Jul 11 2007

Publication series

Name19th International Conference on Software Engineering and Knowledge Engineering, SEKE 2007

Conference

Conference19th International Conference on Software Engineering and Knowledge Engineering, SEKE 2007
CountryUnited States
CityBoston, MA
Period07/9/0707/11/07

Fingerprint Dive into the research topics of 'Predicting order of likelihood of defective software modules'. Together they form a unique fingerprint.

Cite this