Detecting Code Clones with Graph Neural Network and Flow-Augmented Abstract Syntax Tree

By Wenhan Wang, Ge Li, Bo Ma, Xin Xia, Zhi Jin. 2020

325 citations recorded by the source corpus.

Code clones are semantically similar code fragments pairs that are syntactically similar or different. Detection of code clones can help to reduce the cost of software maintenance and prevent bugs. Numerous approaches of detecting code clones have been proposed previously, but most of them focus on detecting syntactic clones and do not work well on semantic clones with different syntactic features. To detect semantic clones, researchers have tried to adopt deep learning for code clone detection to automatically learn latent semantic features from data. Especially, to leverage grammar information, several approaches used abstract syntax trees (AST) as input and achieved significant progress on code clone benchmarks in various programming languages. However, these AST-based approaches still can not fully leverage the structural information of code fragments, especially semantic information such as control flow and data flow. To leverage control and data flow information, in this paper, we build a graph representation of programs called flow-augmented abstract syntax tree (FA-AST). We construct FA-AST by augmenting original ASTs with explicit control and data flow edges. Then we apply two different types of graph neural networks (GNN) on FA-AST to measure the similarity of code pairs. As far as we have concerned, we are the first to apply graph neural networks on the domain of code clone detection. We apply our FA-AST and graph neural networks on two Java datasets: Google Code Jam and BigCloneBench. Our approach outperforms the state-of-the-art approaches on both Google Code Jam and BigCloneBench tasks.

Subfields: Computer Networks and Communications, Information Systems, Graph Learning, Program Analysis & Verification, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Marie-Anne Lachaux
  2. Ge Li
  3. M. Zhou
  4. Neel Sundaresan
  5. Shao Kun Deng
  6. Guillaume Lample
  7. Shengyu Fu
  8. Kai-Wei Chang

In Information Systems

  1. Nan Duan
  2. Daya Guo
  3. Baptiste Rozière
  4. Neel Sundaresan
  5. Alexey Svyatkovskiy
  6. Jian Yin
  7. Marc Szafraniec
  8. Guillaume Lample

In Graph Learning

  1. Ge Li
  2. Kai-Wei Chang
  3. Baishakhi Ray
  4. Duyu Tang
  5. Nan Duan
  6. Saikat Chakraborty

In Program Analysis & Verification

  1. Marie-Anne Lachaux
  2. Ge Li
  3. Jian Yin
  4. Neel Sundaresan
  5. Guillaume Lample
  6. Daya Guo
  7. Marc Szafraniec
  8. Baishakhi Ray

In Signal Processing

  1. Baishakhi Ray
  2. Saikat Chakraborty
  3. Baptiste Rozière
  4. Guillaume Lample
  5. Marie-Anne Lachaux
  6. Wasi Uddin Ahmad
  7. Long Zhou
  8. Ge Li

Citations in the corpus