article · 2019
TECCD: A Tree Embedding Approach for Code Clone Detection
Yifei Gao, Zan Wang, Shuang Liu, Lin Yang, Wei Sang, Yuanfang Cai
Cited by 31Abstract and details only
Abstract
Clone detection techniques have been explored for decades. Recently, deep learning techniques has been adopted to improve the code representation capability, and improve the state-of-the-art in code clone detection. These approaches usually require a transformation from AST to binary tree to incorporate syntactical information, which introduces overheads. Moreover, these approaches conduct term-embedding, which requires large training datasets. In this paper, we introduce a tree embedding technique to conduct clone detection. Our approach first conducts tree embedding to obtain a node vector for each intermediate node in the AST, which captures the structure information of ASTs. Then we compose a tree vector from its involving node vectors using a lightweight method. Lastly Euclidean distances between tree vectors are measured to determine code clones. We implement our approach in a tool called TECCD and conduct an evaluation using the BigCloneBench (BCB) and 7 other large scale Java projects. The results show that our approach achieves good accuracy and recall and outperforms existing approaches.
Cite this paper
Gao, Y., Wang, Z., Liu, S., Yang, L., Sang, W., & Cai, Y. (2019). TECCD: A Tree Embedding Approach for Code Clone Detection. https://doi.org/10.1109/icsme.2019.00025
Gao, Yifei, et al. “TECCD: A Tree Embedding Approach for Code Clone Detection.” 2019, pp. 145–56, https://doi.org/10.1109/icsme.2019.00025.
Gao, Yifei, Zan Wang, Shuang Liu, Lin Yang, Wei Sang, and Yuanfang Cai. 2019. “TECCD: A Tree Embedding Approach for Code Clone Detection.” https://doi.org/10.1109/icsme.2019.00025.
Gao, Y. et al. (2019) ‘TECCD: A Tree Embedding Approach for Code Clone Detection’. Available at: https://doi.org/10.1109/icsme.2019.00025.
@article{gao2019teccd,
title = {{TECCD: A Tree Embedding Approach for Code Clone Detection}},
author = {Gao, Yifei and Wang, Zan and Liu, Shuang and Yang, Lin and Sang, Wei and Cai, Yuanfang},
pages = {145--156},
year = {2019},
doi = {10.1109/icsme.2019.00025}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength
Ruyan Guo, Yan Wang, Jianxi Fan et al. · International Journal of Foundations of Computer Science · 2023
Cited by 10
On the inducibility of small trees
Audace A. V. Dossou-Olory, Stephan G. Wagner · Discrete Mathematics & Theoretical Computer Science · 2019
Cited by 4Open access
An Indexing Scheme for Predicting Future-time Positions of Moving Objects with Frequently Varying Velocities
Sung-Chae Lim · Journal of the Korea Society of Computer and Information · 2010
Cited by 0Open access
ON EXISTENCE OF TREE
Liangzhong Yi · Guizhou kexue · 2005
Cited by 0
A Performance Comparison of Tree Data Structures for N-Body Simulation
Jacob I. Waltz, Gary L. Page, Seth D. Milder et al. · Journal of Computational Physics · 2002
Cited by 21
A TOP-DOWN ALGORITHM FOR CONSTRUCTING NEARLY OPTIMAL LEXICOGRAPHIC TREES††This research was supported in part by the National Research Council of Canada.
W.A. Walker, C. C. Gotlieb · Elsevier eBooks · 1972
Cited by 28