Dichotomy Method toward Interactive Testing-Based Fault Localization

  • Authors:

  • Ji-Rong Sun;Zhi-Shu Li;Jian-Cheng Ni

  • Affiliations:

  • School of Computer Science, Sichuan University, Chengdu, China 610065;School of Computer Science, Sichuan University, Chengdu, China 610065;School of Computer Science, Qufu Normal University, Rizhao Shandong, China 276826

  • Venue:
  • ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A dichotomy method is presented to perform on test-based fault localization. First the test information itself is optimized from three aspects: searching scope localization using slice technique, redundant test case removal, and test suite reduction with nearest series. Secondly, the diagnosis matrix is set up according to the optimized test information and each code is prioritized accordingly. Thirdly, dichotomy method is iteratively applied to an interactive process for seeking the bug: the searching scope is cut in two by the checkpoint cp, which is of the highest priority; If cpis wrong, the bug is found; else we will ignore the codes before/after it according to the result of cp. Finally, we conduct three studies with Siemens suite of 132 program mutants. Our method scores 0.85 on average, which means we only need to check less than 15% of the program before finding out a bug.