Effective Bug Triage With Software Reliability

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    Programming associations spend in excess of 45 percent of cost in overseeing programming bugs. An inevitable progress of settling bugs is bug triage, which wants to precisely dole out a planner to another bug. To reduce the time cost in manual work, content portrayal frameworks are associated with coordinate customized bug triage. In this paper, we address the issue of data diminishment for bug triage, i.e., how to diminish the scale and upgrade the idea of bug data. We unite case assurance with feature decision to at the same time decrease data scale on the bug estimation and the word estimation. To choose the demand of applying event assurance and feature decision, we expel characteristics from evident bug instructive records and create a judicious model for another bug enlightening file. We precisely investigate the execution of data diminish on completely 600,000 bug reports of two significant open source wanders, particularly Eclipse and Mozilla. The results exhibit that our data abatement can satisfactorily decrease the data scale and improve the precision of bug triage. Our work gives an approach to manage using techniques on data taking care of to outline diminished and stunning bug data in programming change and upkeep.

     

     

     


  • Keywords


    data mining, content characterization.

  • References


      [1] J. Anvik, L. Hiew, and G. C. Murphy, Who should settle this bug? in Proc. 28th Int. Conf. Softw. Eng., May 2006, pp. 361– 370.

      [2] S. Artzi, A. Kie_zun, J. Dolby, F. Tip, D. Passage, A. Paradkar, and M. D. Ernst, Discovering bugs in web applications utilizing dynamic test age and unequivocal state show checking, IEEE Softw., vol. 36, no. 4, pp. 474– 494, Jul./Aug. 2010.

      [3] J. Anvik and G. C. Murphy, Reducing the exertion of bug report triage: Recommenders for advancement constructed choices, ACM Trans. Delicate. Eng. Methodol., vol. 20, no. 3, article 10, Aug. 2011.

      [4] C. C. Aggarwal and P. Zhao, Towards graphical models for content administering, Knowl. Illuminate. Syst., vol. 36, no. 1, pp. 1– 21, 2013.

      [5] Bugzilla, (2014). [Online

      [6] K. Balog, L. Azzopardi, and M. de Rijke, Formal models for master finding in big business corpora, in Proc. 29th Annu. Int. ACM SIGIR Conf. Res. Create. Educate. Recovery, Aug. 2006, pp. 43– 50.

      [7] P. S. Bishnu and V. Bhattacherjee, Programming deficiency forecast utilizing quad tree-based k-implies grouping calculation, IEEE Trans. Knowl. Information Eng., vol. 24, no. 6, pp. 1146– 1150, Jun. 2012.

      [8] H. Brighton and C. Mellish, Advances in occasion determina-tion for example based learning calculations, Data Mining Knowl. Revelation, vol. 6, no. 2, pp. 153– 172, Apr. 2002.

      [9] S. Breu, R. Premraj, J. Sillito, and T. Zimmermann, Data needs in bug reports: Improving collaboration amongst engineers and clients, in Proc. ACM Conf. Comput. Upheld Cooperative Work, Feb. 2010, pp. 301– 310.

      [10] V. Bol_on-Canedo, N. S_anchez-Maro~no, and A. Alonso-Betanzos, An audit of highlight determination techniques on manu-factured information, Knowl. Educate. Syst., vol. 34, no. 3, pp. 483– 519, 2013.

      [11] V. Cerver_on and F. J. Ferri, Another push toward the base predictable subset: A tabu hunt way to deal with the dense closest neighbor lead, IEEE Trans. Syst., Man, Cybern., Part B, Cybern., vol. 31, no. 3, pp. 408– 413, Jun. 2001.


 

View

Download

Article ID: 16270
 
DOI: 10.14419/ijet.v7i2.32.16270




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.