Parallel debugging: An investigative study. Issue 11 (9th July 2019)
- Record Type:
- Journal Article
- Title:
- Parallel debugging: An investigative study. Issue 11 (9th July 2019)
- Main Title:
- Parallel debugging: An investigative study
- Authors:
- Zakari, Abubakar
Lee, Sai Peck - Abstract:
- Abstract: In the simultaneous localization of multiple software faults, a parallel debugging approach has consistently been utilized. The effectiveness of a parallel debugging approach is critically determined by the type of clustering algorithm and the distance metric used. However, clustering algorithms that group failed tests based on their execution profile similarity with distance metrics such as Euclidean distance, Jaccard distance, and Hamming distance are considered to be problematic and not appropriate. In this paper, we conducted an investigative study on the usefulness of the problematic parallel debugging approach that makes use of k ‐means clustering algorithm (that groups failed tests based on their execution profile similarity) with Euclidian distance metric on three similarity coefficient‐based fault localization techniques in terms of localization effectiveness. Secondly, we compare the effectiveness of the problematic parallel debugging approach with one‐bug‐at‐a‐time debugging approach (OBA) and a state‐of‐the‐art parallel debugging approach named MSeer. The empirical evaluation is conducted on 540 multiple‐fault versions of eight medium‐sized to large‐sized subject programs with two, three, four, and five faulty versions. Our results suggest that clustering failed tests based on their execution profile similarity and the utilization of distance metrics such as Euclidean distance is indeed problematic and contributes to the reduction of effectiveness inAbstract: In the simultaneous localization of multiple software faults, a parallel debugging approach has consistently been utilized. The effectiveness of a parallel debugging approach is critically determined by the type of clustering algorithm and the distance metric used. However, clustering algorithms that group failed tests based on their execution profile similarity with distance metrics such as Euclidean distance, Jaccard distance, and Hamming distance are considered to be problematic and not appropriate. In this paper, we conducted an investigative study on the usefulness of the problematic parallel debugging approach that makes use of k ‐means clustering algorithm (that groups failed tests based on their execution profile similarity) with Euclidian distance metric on three similarity coefficient‐based fault localization techniques in terms of localization effectiveness. Secondly, we compare the effectiveness of the problematic parallel debugging approach with one‐bug‐at‐a‐time debugging approach (OBA) and a state‐of‐the‐art parallel debugging approach named MSeer. The empirical evaluation is conducted on 540 multiple‐fault versions of eight medium‐sized to large‐sized subject programs with two, three, four, and five faulty versions. Our results suggest that clustering failed tests based on their execution profile similarity and the utilization of distance metrics such as Euclidean distance is indeed problematic and contributes to the reduction of effectiveness in localizing multiple faults. Abstract : Figure 1 shows a program with test cases. The results of our controlled experiments showed that, even though the problematic parallel debugging approach is useful and better in comparison with the OBA debugging approach, yet, it is not as effective when compared with the existing state‐of‐the‐art parallel debugging approach.Therefore, the result affirms the previous studies claims that performing failed tests clustering based on their execution profile similarity, estimating the number of clusters based on the number of failed tests, and the utilization of metrics like Euclidian distance to measure the due‐to relationship between failed test cases are problematic and not appropriate which indeed reduces the effectiveness of a parallel debugging approach. … (more)
- Is Part Of:
- Journal of software. Volume 31:Issue 11(2019)
- Journal:
- Journal of software
- Issue:
- Volume 31:Issue 11(2019)
- Issue Display:
- Volume 31, Issue 11 (2019)
- Year:
- 2019
- Volume:
- 31
- Issue:
- 11
- Issue Sort Value:
- 2019-0031-0011-0000
- Page Start:
- n/a
- Page End:
- n/a
- Publication Date:
- 2019-07-09
- Subjects:
- multiple faults -- parallel debugging -- program debugging -- program spectra -- software fault localization
Software engineering -- Periodicals
Computer software -- Development -- Periodicals
Software maintenance -- Periodicals
005.1 - Journal URLs:
- http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2047-7481 ↗
http://onlinelibrary.wiley.com/ ↗ - DOI:
- 10.1002/smr.2178 ↗
- Languages:
- English
- ISSNs:
- 2047-7473
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 12149.xml