arrow
Return

Learning to recognize actionable static code warnings (is intrinsically easy)

delete2021-04-12
delete20
delete
OA
AI
X
Xueqi Yang
J
Jianfeng Chen
R
Rahul Yedida
Z
Zhe Yu
T
Tim Menzies *
DOI:10.1007/s10664-021-09948-6delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Static code warning tools often generate warnings that programmers ignore. Such tools can be made more useful via data mining algorithms that select the actionable warnings; i.e. the warnings that are usually not ignored. In this paper, we look for actionable warnings within a sample of 5,675 actionable warnings seen in 31,058 static code warnings from FindBugs. We find that data mining algorithms can find actionable warnings with remarkable ease. Specifically, a range of data mining methods (deep learners, random forests, decision tree learners, and support vector machines) all achieved very good results (recalls and AUC(TRN, TPR) measures usually over 95% and false alarms usually under 5%). Given that all these learners succeeded so easily, it is appropriate to ask if there is something about this task that is inherently easy. We report that while our data sets have up to 58 raw features, those features can be approximated by less than two underlying dimensions. For such intrinsically simple data, many different kinds of learners can generate useful models with similar performance. Based on the above, we conclude that learning to recognize actionable static code warnings is easy, using a wide range of learning algorithms, since the underlying data is intrinsically simple. If we had to pick one particular learner for this task, we would suggest linear SVMs (since, at least in our sample, that learner ran relatively quickly and achieved the best median performance) and we would not recommend deep learning (since this data is intrinsically very simple).
Keywords:
Static code analysis
Actionable warnings
Deep learning
Linear SVM
Intrinsic dimensionality

Journal

Empirical Software Engineering cover
Empirical Software Engineering
IF:
3.6
Papers:
2.0K
Citations:
5.3K

Organization

N
North Carolina State University
Scholars:
2.6W
Papers: 2.3W
Citations: 3.7W
Cited Papers

Cited Papers

On the Naturalness of Software
err2016-04-26
err164
PREAI
errHindle, Abram; Barr, Earl T.; Gabel, Mark; Su, Zhendong; Devanbu, Premkumar
errShare
errSave
Rationale and study design of the Adaptive study of IL-2 dose on regulatory T cells in type 1 diabetes (DILT1D): a non-randomised, open label, adaptive dose finding trial
err2014-06-04
err0
errOAAI
errFrank Waldron-Lynch; Paula Kareclas; Kathryn Irons; Neil M Walker; Adrian Mander; Linda S Wicker; John A Todd; Simon Bond
errShare
errSave
Investigating the growth of hyperbranched polymers by self-condensing vinyl RAFT copolymerization from the surface of upconversion nanoparticles
err2020-01-01
err0
errOAAI
errAlireza Kavand; Christian Blanck; Frédéric Przybilla; Yves Mély; Nicolas Anton; Thierry Vandamme; Christophe A. Serra; Delphine Chan-Seng
errShare
errSave
Counterparts and Comparatives
err1993-04-01
err0
PREAI
errP. Milne
errShare
errSave
researcher View more