Integrated Reasoning Engine for Code Clone Detection
DOI:
https://doi.org/10.18034/abcjar.v3i2.575Keywords:
Code Clone Lexer, Programming, Algorithms, Analytics, Duplication, CopyingAbstract
This article seeks to foray into the nitty-gritty of integrated reasoning for code clone detection and how it is effectively carried out, given the amount of analytics usually associated with such activities. Detection of codes requires high-pitch familiarity with cloning systems and their workings. Hence, discovering similar code segments that are often regarded and seen as code imitations (clone) is not an easy responsibility. More especially, this very detection process might possess key purposes in the context of susceptibility findings, refactoring, and imitation detecting. Through the voyage of discovery this article intends to expose you to, you will realize that identical code segments, more often than not described as code clones, appear to be a serious duty, especially for large code bases <1; 2; 3; 4>. There are certain approaches and deep technicalities that this sort of detection is known for. Still, from the avalanche of resources that formed the bedrock of this article, one would discover the easiest formula to adopt in maneuvering such strenuous issues.
Metrics
Downloads
References
B. S. Bread cook, Defined duplication in strings: Calculations and an application to programming upkeep, SIAM Diary on Processing 26 (5) (1997) 1343–1362.
D. Baxter, C. Pidgeon, M. Mehlich, Dms/SPL reg: program transformations for pragmatic, adaptable programming development, in Computer programming, 2004. ICSE 2004. Procedures. 26th Global Meeting on, IEEE, 2004, pp. 625–634.
H. Xue, S. Sun, G. Venkataramani, T. Lan, AI-based investigation of program parallels: An exhaustive report, IEEE Access 7 (2019) 65889–65912.
L. Jiang, G. Misherghi, Z. Su, S. Glondu, Deckard: Versatile and precise tree-based discovery of code clones, in Procedures of the 29th international gathering on Programming, IEEE PC Society, 2007, pp. 96–105.
M. Gabel, Z. Su, An investigation of the uniqueness of source code, in Procedures of the eighteenth ACM SIGSOFT global conference on Establishments of computer programming, ACM, 2010, pp. 147–156.
M. Kim, V. Sazawal, D. Notkin, G. Murphy, An experimental investigation of code clone lineages, in ACM SIGSOFT Programming Notes, Vol. 30, ACM, 2005, pp. 187–196.
Movva, L., Kurra, C., Koteswara Rao, G., Battula, R. B., Sridhar, M., & Harish, P. (2012). Underwater Acoustic Sensor Networks: A Survey on MAC and Routing Protocols. International Journal of Computer Technology and Applications, 3(3).
Narayana, S. L., Suneetha Devi J., Bhargav Reddy I., Harish Paruchuri. (2012). Optimizing Voice Recognition using Various Techniques. CiiT International Journal of Digital Signal Processing, 4(4), 135-141
T. Kamiya, S. Kusumoto, K. Inoue, Ccfinder: a multilinguistic token-based code clone discovery framework for enormous scope source code, IEEE Exchanges on Programming 28 (7) (2002) 654–670.
Ujwala, D., Ram Kiran, D. S., Jyothi, B., Fathima, S. S., Paruchuri, H., Koushik, Y. M. S. R. (2012). A Parametric Study on Impedance Matching of A CPW Fed T-shaped UWB Antenna. International Journal of Soft Computing and Engineering, 2(2), 433-436.
Z. Li, S. Lu, S. Myanmar, Y. Zhou, Cp-digger: Discovering duplicate glue and related bugs in huge scope programming code, IEEE Exchanges on computer programming 32 (3) (2006) 176–192.
--0--
Downloads
Published
Issue
Section
License
