Loading…

Towards more accurate severity prediction and fixer recommendation of software bugs

•We propose REPtopic to search the top-K nearest neighbours of the new bug report.•New algorithms are developed to predict bug severity and recommend bug fixers.•Our approach performs better than the previous works on two bug resolution tasks.•REPtopic presents better performance than REP and cosine...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of systems and software 2016-07, Vol.117, p.166-184
Main Authors: Zhang, Tao, Chen, Jiachi, Yang, Geunseok, Lee, Byungjeong, Luo, Xiapu
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•We propose REPtopic to search the top-K nearest neighbours of the new bug report.•New algorithms are developed to predict bug severity and recommend bug fixers.•Our approach performs better than the previous works on two bug resolution tasks.•REPtopic presents better performance than REP and cosine similarity measures. Due to the unavoidable bugs appearing in the most of the software systems, bug resolution has become one of the most important activities in software maintenance. For large-scale software programs, developers usually depend on bug reports to fix the given bugs. When a new bug is reported, a triager has to complete two important tasks that include severity identification and fixer assignment. The purpose of severity identification is to decide how quickly the bug report should be addressed while fixer assignment means that the new bug needs to be assigned to an appropriate developer for fixing. However, a large number of bug reports submitted every day increase triagers’ workload, thus leading to the reduction in the accuracy of severity identification and fixer assignment. Therefore it is necessary to develop an automatic approach to perform severity prediction and fixer recommendation instead of manual work. This article proposes a more accurate approach to accomplish the goal. We firstly utilize modified REP algorithm (i.e., REPtopic) and K-Nearest Neighbor (KNN) classification to search the historical bug reports that are similar to a new bug. Next, we extract their features (e.g., assignees and similarity) to develop the severity prediction and fixer recommendation algorithms. Finally, by adopting the proposed algorithms, we achieve severity prediction and semi-automatic fixer recommendation on five popular open source projects, including GNU Compiler Collection (GCC), OpenOffice, Eclipse, NetBeans, and Mozilla. The results demonstrated that our method can improve the performance of severity prediction and fixer recommendation through comparison with the cutting-edge studies.
ISSN:0164-1212
1873-1228
DOI:10.1016/j.jss.2016.02.034