An AST-based Code Plagiarism Detection Algorithm
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
In modern software engineering, software plagiarism is widespread and uncurbed, developing plagiarism detection methods is imperative. Popular technologies of software plagiarism detection are mostly based on text, token and syntax tree. Among these plagiarism detection technologies, tree-based plagiarism detection technology can effectively detect the code which cannot be detected by the other two kinds of technologies. In this paper, we propose a more effective plagiarism detection algorithm based on abstract syntax tree (AST) by computing the hash values of the syntax tree nodes, and comparing them. In order to implement the algorithm more effectively, special measurement is taken to reduce the error rate when calculating the hash values of operations, especially the arithmetic operations like subtraction and division. Results of the test showed that the measurement is reliable and necessary. It performs well in the code comparison field, and is helpful in the area of protecting source code's copyright.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Clone detection using abstract syntax trees
Baxter, I. D., Yahin, A., Moura, L., Sant'Anna, M., & Bier, L. (2002) · Proceedings. International Conference on Software Maintenance (Cat. No. 98CB36272) · doi:10.1109/icsm.1998.738528 · Cited by 1,277 · cited 1×
“Recently, with further study, some improved algorithms have been proposed based on the three plagiarism detection technology [9].”
BackgroundPlagiarism in programming assignments
Joy, M., & Luck, M. (1999) · IEEE Transactions on Education · doi:10.1109/13.762946 · Cited by 299
Research works printed but not linked: 15
- 10.1109/IWSC.2012.6227862 · DOI
- 10.1109/ICCSE.2012.6295247 · DOI
- 10.1109/InfRKM.2012.6204978 · DOI
- 10.1109/TC.2011.223 · DOI · Paper page
- agung toto, 0, Comparison between fingerprint and winnowing algorithm to detect plagiarism fraud on Bahasa Indonesia documents, 2013 International Conference of Information and Communication Technology (ICoICT) ICoICT, 128
- 10.1109/TIFS.2012.2223685 · DOI · Paper page
- 10.1109/IMCL.2012.6396471 · DOI
- gipp, 2011, Comparative Evaluation of Text-and Citation-based Plagiarism Detection Approaches using Gutten-Plag, Proceeding of the 11th annual international ACM/IEEE joint conference, 10.1145/1998076.1998124 · DOI
- komondoor, 2001, Using slicing to identify duplication in source code, SAS, 40
- 10.1109/TE.2011.2112768 · DOI · Paper page
- li, 2004, CP-Miner: A tool for finding copy-paste and related bugs in operating system code, OSDI, 289
- 10.1109/WCRE.2001.957835 · DOI · Paper page
- 10.1016/j.scico.2009.02.007 · DOI · Paper page
- 10.1109/TSE.2002.1019480 · DOI · Paper page
- 10.1109/ICISA.2012.6220932 · DOI
Cited by
Academic Source Code Plagiarism Detection by Measuring Program Behavioral Similarity
Cheers, H., Lin, Y., & Smith, S. P. (2021) · IEEE Access · doi:10.1109/access.2021.3069367 · Cited by 59
Detecting Pervasive Source Code Plagiarism through Dynamic Program Behaviours
Cheers, H., Lin, Y., & Smith, S. P. (2020) · Proceedings of the Twenty-Second Australasian Computing Education Conference · doi:10.1145/3373165.3373168 · Cited by 13
“• 3 provided the data set which it was evaluated on [17, 19, 25]; although these data sets were not assignments.”
BackgroundPrado, B., Bispo, K., & Andrade, R. (2018) · Proceedings of the 20th International Conference on Enterprise Information Systems · doi:10.5220/0006668705170524 · Cited by 9
Metadata
- Authors
- Zhao, J., Xia, K., Fu, Y., & Cui, B.
- Venue
- 2015 10th International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)
- Publisher
- IEEE
- Published
- 2015-11
- Pages
- 178-182
- OpenAlex
- W2293891280
- Cited by
- 43
- References
- 2
- FWCI
- 3.22
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.