DeepBugs: a learning approach to name-based bug detection

Michael Pradel, Koushik Sen

Proceedings of the ACM on Programming Languages · 2018 · 328 citations · 53 references

DOIFull text

Open access

Concepts

TL;DR

Natural language elements in source code, such as variable and function names, convey useful information, yet most bug‑detection tools ignore this and miss bugs, and existing name‑based approaches rely on syntactic reasoning and manual tuning. This paper presents DeepBugs, a learning approach to name‑based bug detection that reasons about names using a semantic representation and automatically learns bug detectors instead of manually writing them. We formulate bug detection as a binary classification problem, train a classifier to distinguish correct from incorrect code, generate incorrect examples via simple transformations, implement the idea in a framework, and build three detectors for swapped arguments, incorrect operators, and operands. Learning from artificially seeded bugs yields detectors that effectively find real‑world bugs; applied to 150 k JavaScript files, the detectors achieve 89–95 % accuracy, run in under 20 ms per file, and uncover 102 mistakes with a 68 % true‑positive rate.

Abstract

Natural language elements in source code, e.g., the names of variables and functions, convey useful information. However, most existing bug detection tools ignore this information and therefore miss some classes of bugs. The few existing name-based bug detection approaches reason about names on a syntactic level and rely on manually designed and tuned algorithms to detect bugs. This paper presents DeepBugs, a learning approach to name-based bug detection, which reasons about names based on a semantic representation and which automatically learns bug detectors instead of manually writing them. We formulate bug detection as a binary classification problem and train a classifier that distinguishes correct from incorrect code. To address the challenge that effectively learning a bug detector requires examples of both correct and incorrect code, we create likely incorrect code examples from an existing corpus of code through simple code transformations. A novel insight learned from our work is that learning from artificially seeded bugs yields bug detectors that are effective at finding bugs in real-world code. We implement our idea into a framework for learning-based and name-based bug detection. Three bug detectors built on top of the framework detect accidentally swapped function arguments, incorrect binary operators, and incorrect operands in binary operations. Applying the approach to a corpus of 150,000 JavaScript files yields bug detectors that have a high accuracy (between 89% and 95%), are very efficient (less than 20 milliseconds per analyzed file), and reveal 102 programming mistakes (with 68% true positive rate) in real-world code.

References

53