Detecting source code plagiarism on introductory programming course assignments using a bytecode approach
The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
Even though there are various source code plagiarism detection approaches, most of them only concern with low-level plagiarism attack with an assumption that plagiarism is only conducted by students who are not proficient in programming. However, plagiarism is often conducted not only due to student incapability, but also because of bad time management. Thus, high-level plagiarism attack should be detected and evaluated. This paper proposes source code plagiarism detection approach which can detect most introductory-programming-course plagiarism attacks at any level by utilizing low-level instructions instead of source code tokens. Several mechanisms are also introduced to improve its effectiveness such as instruction generalization, instruction reinterpretation, method-based comparison, and method linearization. Since low-level instruction is a language-dependent feature, Java is selected as target programming language with bytecode as its low-level instruction. Based on evaluation, it can be concluded that our approach is more effective to detect most plagiarism attack types than raw source code approach on introductory programming course. This evaluation is based on plagiarism attack types that are collected through controlled experiment.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“We design our mechanism and evaluate it for specific obfuscation attacks, as they are frequently employed in manual obfuscation attacks [20,32] and are highly automatable [13].”
From Detecting Automatic Software Plagiarism via Token Sequence Normalization (2024) · cites this paper as [20]
Citations
Cites
Identifying similar code with program dependence graphs
Krinke, J. (2002) · Proceedings Eighth Working Conference on Reverse Engineering · doi:10.1109/wcre.2001.957835 · Cited by 616 · cited 1×
“In order to utilize more language-specific features, several approaches exploit more sophisticated representation such as abstract syntax tree [13, 14, 15, 16], control flow graph [17], and program dependence graph [18].”
MethodLoad-Time Structural Reflection in Java
Chiba, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45102-1_16 · Cited by 261 · cited 1×
“Each method content in selected method pairs is extracted with Javassist [22] and most instructions are either generalized or reinterpreted.”
MethodFaidhi, J. A. W., & Robinson, S. K. (1987) · Computers & Education · doi:10.1016/0360-1315(87)90042-x · Cited by 198 · cited 6×
“Beside proposed plagiarism detection approach, this paper also enlists several possible plagiarism attack types in Java introductory programming which then will be classified based on Faidhi and Robinson’s plagiarism classification [6].”
BackgroundMethodInfluentialTowards a Definition of Source-Code Plagiarism
Cosma, G., & Joy, M. (2008) · IEEE Transactions on Education · doi:10.1109/te.2007.906776 · Cited by 146 · cited 1×
“Source code plagiarism is a major issue which emerges in Programming course [1].”
BackgroundSyntax tree fingerprinting for source code similarity detection
Chilowicz, M., Duris, É., & Roussel, G. (2009) · IEEE International Conference on Program Comprehension (ICPC) · doi:10.1109/icpc.2009.5090050 · Cited by 117 · cited 1×
“In order to utilize more language-specific features, several approaches exploit more sophisticated representation such as abstract syntax tree [13, 14, 15, 16], control flow graph [17], and program dependence graph [18].”
MethodDetecting similar Java classes using tree algorithms
Sager, T., Bernstein, A., Pinzger, M., & Kiefer, C. (2006) · Proceedings of the 2006 international workshop on Mining software repositories · doi:10.1145/1137983.1138000 · Cited by 88 · cited 1×
“In order to utilize more language-specific features, several approaches exploit more sophisticated representation such as abstract syntax tree [13, 14, 15, 16], control flow graph [17], and program dependence graph [18].”
MethodDetection of similarities in student programs: YAP'ing may be preferable to plague'ing
Wise, M. J. (1992) · Proceedings of the twenty-third SIGCSE technical symposium on Computer science education · doi:10.1145/134510.134564 · Cited by 87 · cited 3×
“[25] M. J. Wise, "Detection of similarities in student programs: YAP'ing may be preferable to plague'ing," in Proceedings of the twenty-third SIGCSE technical symposium on Computer science education, New York, 1992.”
MethodInfluentialPlagiarism detection using feature-based neural networks
Engels, S., Lakshmanan, V., & Craig, M. (2007) · Proceedings of the 38th SIGCSE technical symposium on Computer science education · doi:10.1145/1227310.1227324 · Cited by 74 · cited 1×
“These kind of approaches are commonly used in major plagiarism detection methods such as attribute-counting [6], token matching [2, 3], classification [8, 9, 10], latent semantic analysis [11], and clustering [12] method.”
MethodLange, R., & Mancoridis, S. (2007) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1276958.1277364 · Cited by 70 · cited 1×
“These kind of approaches are commonly used in major plagiarism detection methods such as attribute-counting [6], token matching [2, 3], classification [8, 9, 10], latent semantic analysis [11], and clustering [12] method.”
MethodSoftware plagiarism detection: a graph-based approach
Chae, D.-K., Ha, J., Kim, S.-W., Kang, B., & Im, E. G. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2507848 · Cited by 66 · cited 1×
“In order to utilize more language-specific features, several approaches exploit more sophisticated representation such as abstract syntax tree [13, 14, 15, 16], control flow graph [17], and program dependence graph [18].”
MethodAutomatic Source Code Plagiarism Detection
Kustanto, C., & Liem, I. (2009) · 2009 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing · doi:10.1109/snpd.2009.62 · Cited by 58 · cited 3×
“These kind of approaches are commonly used in major plagiarism detection methods such as attribute-counting [6], token matching [2, 3], classification [8, 9, 10], latent semantic analysis [11], and clustering [12] method.”
BackgroundMethodLanguage-Independent Clone Detection Applied to Plagiarism Detection
Brixtel, R., Fontaine, M., Lesner, B., Bazin, C., & Robbes, R. (2010) · 2010 10th IEEE Working Conference on Source Code Analysis and Manipulation · doi:10.1109/scam.2010.19 · Cited by 56 · cited 1×
“One of this approach is proposed by Brixtel et al which detect plagiarism by utilizing multiple level plagiarism recognition from character level to corpus level [7].”
MethodFinding Plagiarisms among a Set of Programs with JPlag
Malpohl, G., Prechelt, L., & Philippsen, M. (2002) · Verlag der Technischen Universität Graz · doi:10.3217/jucs-008-11-1016 · Cited by 56 · cited 2×
“These kind of approaches are commonly used in major plagiarism detection methods such as attribute-counting [6], token matching [2, 3], classification [8, 9, 10], latent semantic analysis [11], and clustering [12] method.”
BackgroundMethodPDE4Java: Plagiarism Detection Engine for Java source code: a clustering approach
Jadalla, A., & Elnagar, A. (2008) · International Journal of Business Intelligence and Data Mining · doi:10.1504/ijbidm.2008.020514 · Cited by 37 · cited 1×
“These kind of approaches are commonly used in major plagiarism detection methods such as attribute-counting [6], token matching [2, 3], classification [8, 9, 10], latent semantic analysis [11], and clustering [12] method.”
MethodA Machine Learning Based Tool for Source Code Plagiarism Detection
Bandara, U., & Wijayarathna, G. (2011) · International Journal of Machine Learning and Computing · doi:10.7763/ijmlc.2011.v1.50 · Cited by 34 · cited 1×
“These kind of approaches are commonly used in major plagiarism detection methods such as attribute-counting [6], token matching [2, 3], classification [8, 9, 10], latent semantic analysis [11], and clustering [12] method.”
MethodA Plagiarism Detection Technique for Java Program Using Bytecode Analysis
Ji, J.-H., Woo, G., & Cho, H.-G. (2008) · doi:10.1109/iccit.2008.267 · Cited by 31
Evaluating the performance of LSA for source-code plagiarism detection
Cosma, G., & Joy, M. S. (2012) · Informatica · doi:10.82444/warw.33623506 · Cited by 23
Detecting code theft via a static instruction trace birthmark for Java methods
Park, H., Choi, S., Lim, H.-I., & Han, T. (2008) · IEEE International Conference on Industrial Informatics (INDIN) · doi:10.1109/indin.2008.4618162 · Cited by 22 · cited 1×
“jsr, jsr_w,and ret are reinterpreted as goto sequence which mechanism is adopted from [23].”
BackgroundA novel approach based on formal methods for clone detection
Cuomo, A., Santone, A., & Villano, U. (2012) · IEEE International Workshop on Software Clones (IWSC) · doi:10.1109/iwsc.2012.6227879 · Cited by 19 · cited 2×
“Cuomo et al exploits Java bytecodes for detecting plagiarism by applying formal method to determine bytecode similarity [20].”
BackgroundMethodPlagiarism Detection for Java Programs without Source Codes
Anjali, V., Swapna, T. R., & Jayaraman, B. (2015) · Procedia Computer Science · doi:10.1016/j.procs.2015.02.143 · Cited by 18 · cited 2×
“On the other hand, several different and unique approaches are also developed by utilizing low-level instruction instead of source code [19, 20].”
BackgroundFinding Similarities in Source Code Through Factorization
Chilowicz, M., Duris, É., & Roussel, G. (2009) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2009.09.040 · Cited by 18 · cited 1×
“In order to utilize more language-specific features, several approaches exploit more sophisticated representation such as abstract syntax tree [13, 14, 15, 16], control flow graph [17], and program dependence graph [18].”
MethodDetecting source code similarity using low-level languages
Juričić, V. (2011) · ITI ... · Cited by 12
Java archives search engine using byte code as information source
Karnalim, O., & Mandala, R. (2014) · International Conference on Data and Software Engineering · doi:10.1109/icodse.2014.7062660 · Cited by 10 · cited 3×
“However, our approach is quite different with [24] since we remove recursive method calls on recursive methods instead of limiting recursive method linearization.”
BackgroundMethodSelf-citationPoongodi, D., & Arasu, G. T. (2014) · International Journal of Computer Applications · doi:10.5120/15796-4494 · Cited by 1 · cited 1×
“In order to utilize more language-specific features, several approaches exploit more sophisticated representation such as abstract syntax tree [13, 14, 15, 16], control flow graph [17], and program dependence graph [18].”
Method
Research works printed but not linked: 2
- liang, 2013, Introduction to Java Programming Comprehensive Version Ninth Edition
- wise, 1993, Running rabin-karp matching and greedy string tiling, Department of Computer Science University of Sydney
Cited by
Introductory programming: a systematic literature review
Luxton-Reilly, A., Simon, Albluwi, I., Becker, B. A., Giannakos, M., Kumar, A. N., Ott, L., Paterson, J., Scott, M. J., Sheard, J., et al. (2018) · Proceedings Companion of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education · doi:10.1145/3293881.3295779 · Cited by 485
“Improvement on existing methods for detecting code similarity was found by comparing low-level instructions rather than source code tokens [315] and by applying unsupervised learning techniques to features extracted”
MethodAcademic 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
“To ensure the generated programs are representative of undergraduate plagiarism, all implemented source code transformations (listed in table 4) are referenced from prior literature [7], [10], [50], [51], and conform to the first 5 levels of Faidhi and Robinson’s [10] transformation taxonomy.”
MethodSimilarity Detection Techniques for Academic Source Code Plagiarism and Collusion: A Review
Karnalim, O., Simon, & Chivers, W. (2019) · IEEE International Conference on Teaching, Assessment, and Learning for Engineering · doi:10.1109/tale48000.2019.9225953 · Cited by 49
“Executable files, which result from compiling source code, can provide a more compact representation than the source code itself [83]: they contain only semantics-preserving tokens, and most (cid:5) syntactic sugar (cid:6) forms have been translated to their common form; for example, all for loops…”
BackgroundMethodSelf-citationES‐Plag: Efficient and sensitive source code plagiarism detection tool for academic environment
Sulistiani, L., & Karnalim, O. (2018) · Computer Applications in Engineering Education · doi:10.1002/cae.22066 · Cited by 40
“Fourth, Low-Level Token Sequence (from the binary file of compiled source code) is used in [18,19,39] where its comparison works in similar way as in typical structure-based detection.”
MethodSelf-citationSyntax Trees and Information Retrieval to Improve Code Similarity Detection
Karnalim, O., & Simon (2020) · Australasian Computing Education Conference · doi:10.1145/3373165.3373171 · Cited by 36
“A low-level token string [16], for instance, is a token sequence extracted from the executable files that result from compiling the source code.”
BackgroundMethodSelf-citation
Metadata
- Authors
- Karnalim, O.
- Affiliations
- Maranatha Christian University (ID)
- Corresponding author
- Karnalim, Oscar
- ORCID
- Karnalim, Oscar
- Venue
- 2016 International Conference on Information & Communication Technology and Systems (ICTS)
- Publisher
- IEEE
- Published
- 2016
- Pages
- 63-68
- OpenAlex
- W2609731675
- Cited by
- 46
- References
- 24
- Citations by year
- 2026: 2 · 2025: 2 · 2024: 2 · 2023: 3 · 2022: 6 · 2021: 3 · 2020: 6 · 2019: 6 · 2018: 12 · 2017: 4
- FWCI
- 30.87
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Information & Communication Technology and System (ICTS) (publishedVersion)
- Topics
- Social Sciences › Education › Academic integrity and plagiarism
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
- Keywords
- code plagiarism detection, bytecode, introductory programming courses, Java, academic integrity
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.