资源论文HOPPITY :L EARNING GRAPH TRANSFORMATIONS TOD ETECT AND FIX BUGS IN PROGRAMS

HOPPITY :L EARNING GRAPH TRANSFORMATIONS TOD ETECT AND FIX BUGS IN PROGRAMS

2020-01-02 | |  109 |   36 |   0

Abstract

We present a learning-based approach to detect and fix a broad range of bugs in Javascript programs. We frame the problem in terms of learning a sequence of graph transformations: given a buggy program modeled by a graph structure, our model makes a sequence of predictions including the position of bug nodes and corresponding graph edits to produce a fix. Unlike previous works that use deep neural networks, our approach targets bugs that are more complex and semantic in nature (i.e. bugs that require adding or deleting statements to fix). We have realized our approach in a tool called H OPPITY. By training on 290,715 Javascript code change commits on Github, H OPPITY correctly detects and fixes bugs in 9,490 out of 36,361 programs in an end-to-end fashion. Given the bug location and type of the fix, H OPPITY also outperforms the baseline approach by a wide margin.

上一篇:LEARNING REPRESENTATIONS FOR BINARY-CLASSIFICATION WITHOUT BACKPROPAGATION

下一篇:SEED RL: SCALABLE AND EFFICIENT DEEP -RL WITHACCELERATED CENTRAL INFERENCE

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...