Lune

ICLR2020顶会

Hoppity: Learning Graph Transformations to Detect and Fix Bugs in Programs

Elizabeth Dinella, Hanjun Dai, Ziyang Li, Mayur Naik, Le Song, Ke Wang

出版方
2020年份
212被引次数
49顶会引用

摘要

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 HOPPITY. By training on 290,715 Javascript code change commits on Github, HOPPITY 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, HOPPITY also outperforms the baseline approach by a wide margin. <br><br>A talk presented at the SIAM CSE21 conference, MS187: Data-Driven Analysis of Scientific Software Quality, Availability, and Development Productivity.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

lune papers fulltext 960f22d1-cbbd-4cb2-8515-e53b0e075671

引用它的顶会 Paper49

问问它们各自怎么用它

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖