Cited by 337Software Testing and Debugging TechniquesSoftware Engineering ResearchSoftware System Performance and Reliability

DeepFL: integrating multiple fault diagnosis dimensions for deep fault localization

Open access
Li, Xia, Li, Wei, Zhang, Yuqun, Zhang, Lingming·2019·Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis

Abstract

Learning-based fault localization has been intensively studied recently. Prior studies have shown that traditional Learning-to-Rank techniques can help precisely diagnose fault locations using various dimensions of fault-diagnosis features, such as suspiciousness values computed by various off-the-shelf fault localization techniques. However, with the increasing dimensions of features considered by advanced fault localization techniques, it can be quite challenging for the traditional Learning-to-Rank algorithms to automatically identify effective existing/latent features. In this work, we propose DeepFL, a deep learning approach to automatically learn the most effective existing/latent features for precise fault localization. Although the approach is general, in this work, we collect various suspiciousness-value-based, fault-proneness-based and textual-similarity-based features from the fault localization, defect prediction and information retrieval areas, respectively. DeepFL has been studied on 395 real bugs from the widely used Defects4J benchmark. The experimental results show DeepFL can significantly outperform state-of-the-art TraPT/FLUCCS (e.g., localizing 50+ more faults within Top-1). We also investigate the impacts of deep model configurations (e.g., loss functions and epoch settings) and features. Furthermore, DeepFL is also surprisingly effective for cross-project prediction.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3293882.3330574

Cites

84 of 84 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

3 of the 87 references couldn’t be matched to a known paper.

Research works printed but not linked: 5

  1. C. Le Goues, M. Dewey-Vogt, S. Forrest, and W. Weimer, łA systematic study of automated program repair: Fixing 55 out of 105 bugs for $8 each,ž in Software Engineering (ICSE), 2012 34th International Conference on, 2012, pp. 3ś13.
  2. S. Kim, C. Le Goues, M. Pradel, and A. Roychoudhury, łAutomated program repair (dagstuhl seminar 17022),ž in Dagstuhl Reports, vol. 7, no. 1. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017.
  3. Y. LeCun, C. Cortes, and C. Burges, łMnist handwritten digit database,ž AT&T Labs [Online]. Available: http://yann. lecun. com/exdb/mnist, vol. 2, 2010.
  4. łEffect size,ž 2016. [Online]. Available: https://www.ncbi.nlm.nih.gov/pmc/ articles/PMC5122517/
  5. S. Shamshiri, R. Just, J. M. Rojas, G. Fraser, P. McMinn, and A. Arcuri, łDo auto- matically generated unit tests find real faults? an empirical study of effectiveness and challenges (t), ž in 2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE). IEEE, 2015, pp. 201ś211.

Cited by

Sorted by citations

Authors
Li, X., Li, W., Zhang, Y., & Zhang, L.
Affiliations
  • University of Texas at Dallas, USA
  • Southern University of Science and Technology (CN)
  • The University of Texas at Dallas (US)
Venue
Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis
Publisher
ACM
Published
2019-07-10
Pages
169-180
OpenAlex
W2958754741
Cited by
336
References
87
Citations by year
2026: 48 · 2025: 62 · 2024: 57 · 2023: 47 · 2022: 51 · 2021: 42 · 2020: 20 · 2019: 9
FWCI
21.54
Type
conference paper
Language
en
Open access
Locations
ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) (publishedVersion)
Funders
  • Shenzhen Peacock Plan (KQTD2016112514355531)
  • National Science Foundation (CCF-1566589,CCF-1763906)
  • Science and Technology Innovation Committee Foundation of Shenzhen (JCYJ20170817110848086)
Topics
  • Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
Keywords
feature selection, latent feature learning, fault proneness, fault prediction, information retrieval, cross-project prediction, Defects4J, loss functions

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review