The Efficiency of Critical Slicing in Fault Localization

  • Authors:

  • Z. A. Al-Khanjari;M. R. Woodward;Haider Ali Ramadhan;N. S. Kutti

  • Affiliations:

  • Computer Science Department, Sultan Qaboos University, Sultanate of Oman;Department of Computer Science, University of Liverpool, Chadwick Building, Liverpool, UK L69 7ZF;Computer Science Department, Sultan Qaboos University, Sultanate of Oman;Computer Science Department, Sultan Qaboos University, Sultanate of Oman

  • Venue:
  • Software Quality Control
  • Year:
  • 2005

Quantified Score

Hi-index 0.02

Visualization

Abstract

In software testing, developing effective debugging strategies is important to guarantee the reliability of software under testing. A heuristic technique is to cause failure and therefore expose faults. Based on this approach mutation testing has been found very useful technique in detecting faults. However, it suffers from two problems with successfully testing programs: (1) requires extensive computing resources and (2) puts heavy demand on human resources. Later, empirical observations suggest that critical slicing based on Statement Deletion (Sdl) mutation operator has been found the most effective technique in reducing effort and the required computing resources in locating the program faults. The second problem of mutation testing may be solved by automating the program testing with the help of software tools. Our study focuses on determining the effectiveness of the critical slicing technique with the help of the Mothra Mutation Testing System in detecting program faults. This paper presents the results showing the performance of Mothra Mutation Testing System through conducting critical slicing testing on a selected suite of programs.