Email this article An Approach to Improving Bug Assignment with Bug Tossing Graphs and Bug Similarities
Abstract
In open-source software development a new bug firstly is found by developers or users. Then the bug is described as a bug report, which is submitted to a bug repository. Finally the bug triager checks the bug report and typically assigns a developer to fix the bug. The assignment process is time-consuming and error-prone. Furthermore, a large number of bug reports are tossed (reassigned) to other developers, which increases bug-fix time.
In order to quickly identify the fixer to bug reports we present an approach based on the bug tossing history and textual similarities between bug reports. This proposed approach is evaluated on Eclipse and Mozilla. The results show that our approach can significantly improve the efficiency of bug assignment: the bug fixer is often identified with fewer tossing events.
Keywords
References
[1] Bugzilla. http://www.bugzilla.org/.
[2] J. Anvik, L. Hiew, and G. Murphy, “Who should fix this bug?” in Proceedings of the 28th international conference on Software engineering. ACM, 2006, p. 370.
[3] G. Jeong, S. Kim, and T. Zimmermann, “Improving bug triage with bug tossing graphs,” in Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering on European software engineering conference and foundations of software engineering symposium. ACM, 2009, pp. 111–120.
[4] P. Runeson, M. Alexandersson, and O. Nyholm, “Detection of duplicate defect reports using natural language processing,” in Proceedings of the 29th international conference on Software Engineering. IEEE Computer Society, 2007, pp. 499–510.
[5] L. Hiew, “Assisted detection of duplicate bug reports,” Master’s thesis,The University Of British Columbia, 2006.
[6] X. Wang, L. Zhang, T. Xie, J. Anvik, and J. Sun, “An approach to detecting duplicate bug reports using natural language and execution information,” in Proceedings of the 30th international conference on Software engineering. ACM New York, NY, USA, 2008, pp. 461–470.
[7] D. Cubranic, “Automatic bug triage using text categorization,” in SEKE 2004: Proceedings of the Sixteenth International Conference on Software Engineering & Knowledge Engineering. Citeseer, 2004, pp. 92–97.
[8] C. D. Manning, P. Raghavan, and H. Sch¨utze, An Introduction to Information Retrieval. Cambridge
[9] Y. Wang, L. Li, and D. Xu, “Pervasive QoS routing in next generation networks,” Computer Communications, vol. 31, no. 14, pp. 3485–3491, 2008. University Press, 2008.
[10] N. Bettenburg, S. Just, A. Schroter, C. Weiss, R. Premraj, and T. Zimmermann, “What makes a good bug report?” in Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering. ACM, 2008, pp. 308–318.
[11] N. Bettenburg, R. Premraj, T. Zimmermann, and S. Kim, “Duplicate bug reports considered harmful... really?” in Proceedings of the 24th IEEE International Conference on Software Maintenance, September 2008.
[12] Q. Shao, Y. Chen, S. Tao, X. Yan, and N. Anerousis, “Efficient ticket routing by resolution sequence mining,” in Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2008, pp. 605–613.
[13] R. Silva, J. Zhang, and J. G. Shanahan. Probabilistic workflow mining. In KDD ’05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pages 275–284, New York, NY, USA, 2005. ACM.
[14] W. van der Aalst, T. Weijters, and L. Maruster. Workflow mining: Discovering process models from event logs. IEEE Trans. on Knowl. and Data Eng., 16(9):1128–1142, 2004.
doi:10.1109/TKDE.2004.47
[15] R. Agrawal, D. Gunopulos, and F. Leymann, “Mining process models from workflow logs,” Advances in Database Technology in EDBT’98, pp. 467–483, 1998.
doi:10.1007/BFb0101003
[16] A. Rozinat and W. van der Aalst, “Decision mining in ProM,” Business Process Management, pp. 420–425, 2006.
[17] H. Mannila and D. Rusakov, “Decomposition of event sequences into independent components,” in Proc. of the First SIAM Conference on Data Mining. Citeseer, 2001.
[18] J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu, “PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth,” in icccn. Published by the IEEE Computer Society, 2001, p. 0215.
Full Text: PDF