Software plagiarism detection: a graph-based approach
The DOI matches its Crossref record; 13 of the 14 references it cites were found in a registry or an index.
Abstract
As plagiarism of software increases rapidly, there are growing needs for software plagiarism detection systems. In this paper, we propose a software plagiarism detection system using an API-labeled control flow graph (A-CFG) that abstracts the functionalities of a program. The A-CFG can reflect both the sequence and the frequency of APIs, while previous work rarely considers both of them together. To perform a scalable comparison of a pair of A-CFGs, we use random walk with restart (RWR) that computes an importance score for each node in a graph. By the RWR, we can generate a single score vector for an A-CFG and can also compare A-CFGs by comparing their score vectors. Extensive evaluations on a set of Windows applications demonstrate the effectiveness and the scalability of our proposed system compared with existing methods.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
An information-theoretic perspective of tf–idf measures
Aizawa, A. (2003) · Information Processing & Management · doi:10.1016/s0306-4573(02)00021-3 · Cited by 1,419
Group-Theoretic Algorithms and Graph Isomorphism
(1982) · Lecture Notes in Computer Science · doi:10.1007/3-540-11493-9 · Cited by 196 · cited 2×
“Since an A-CFG usually has tens of thousands or millions of nodes, most of graph comparison algorithms such as graph isomorphism or maximum common sub-graph are infeasible to be employed in practice [10].”
BackgroundMOSS : A system for detecting software plagiarism
Aiken, A. (2004) · Medical Entomology and Zoology · Cited by 141
Compiler Construction: Principles and Practice
Louden, K. C. (1997) · Cited by 136
A static API birthmark for Windows binary executables
Choi, S., Park, H., Lim, H.-I., & Han, T. (2008) · Journal of Systems and Software · doi:10.1016/j.jss.2008.11.848 · Cited by 53 · cited 6×
“Set-based approaches, for example, use a set of API calls used in a program [2].”
BackgroundMethodInfluentialA method for detecting the theft of Java programs through analysis of the control flow information
Lim, H.-I., Park, H., Choi, S., & Han, T. (2009) · Information and Software Technology · doi:10.1016/j.infsof.2009.04.011 · Cited by 46
Detecting Java Theft Based on Static API Trace Birthmark
Park, H., Choi, S., Lim, H.-I., & Han, T. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89598-5_8 · Cited by 30 · cited 2×
“The A-CFG not only inherits unique characteristics of a program but also is robust to plagiarism because it is difficult for a plagiarist to manipulate the call frequency or the sequence of APIs or to replace APIs with something else while maintaining the program’s original semantics [2-4].”
BackgroundMethodYet another paper ranking algorithm advocating recent publications
Hwang, W., Chae, S.-M., Kim, S., & Woo, G. (2010) · International World Wide Web Conference (WWW) · doi:10.1145/1772690.1772832 · Cited by 28 · cited 1×
“If one API may RWR is widely used to calculate each node’s importance in a graph [13, 14, 15].”
MethodSelf-citation
Research works printed but not linked: 3
- 10.5555/1032649.1033513 · doi:10.5555/1032649.1033513
- 10.5555/1076797 · doi:10.5555/1076797
- 10.5555/523017 · doi:10.5555/523017
Cited by
DGCNN: A convolutional neural network over large-scale labeled graphs
Phan, A. V., Nguyen, M. L., Nguyen, Y. L. H., & Bui, L. T. (2018) · Neural Networks · doi:10.1016/j.neunet.2018.09.001 · Cited by 355
Automated Assessment in Computer Science Education: A State-of-the-Art Review
Paiva, J. C., Leal, J. P., & Figueira, Á. (2022) · ACM Transactions on Computing Education · doi:10.1145/3513140 · Cited by 274
“So, they typically encode information using graphs, such as program dependence graphs [52, 210], control-low graphs [45], and call graphs [187], rather than tokens and trees.”
BackgroundCyber Security Threats Detection in Internet of Things Using Deep Learning Approach
Ullah, F., Naeem, H., Jabbar, S., Khalid, S., Latif, M. A., Al-turjman, F., & Mostarda, L. (2019) · IEEE Access · doi:10.1109/access.2019.2937347 · Cited by 266
Convolutional Neural Networks over Control Flow Graphs for Software Defect Prediction
Phan, A. V., Nguyen, L.-M., & Bui, L. T. (2017) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2017.00019 · Cited by 169
A comparison of code similarity analysers
Ragkhitwetsagul, C., Krinke, J., & Clark, D. (2018) · Empirical Software Engineering · doi:10.1007/s10664-017-9564-7 · Cited by 122
“Algorithms for graph comparison are mostly NP-complete (Liu et al. 2006; Crussell et al. 2012; Krinke 2001; Chae et al. 2013).”
BackgroundMethod
Metadata
- Authors
- Chae, D.-K., Ha, J., Kim, S.-W., Kang, B., & Im, E. G.
- Affiliations
- Hanyang University (KR)
- Venue
- Proceedings of the 22nd ACM international conference on Information & Knowledge Management
- Publisher
- ACM
- Published
- 2013-10-27
- Pages
- 1577-1580
- ISSN
- 2155-0751 (ISSN-L)
- OpenAlex
- W1985205072
- Semantic Scholar
- 1e1b6acb54f2508f5bfd4660bd95cdcdad8a30d5
- Cited by
- 66
- References
- 14
- Citations by year
- 2025: 7 · 2024: 9 · 2023: 4 · 2022: 10 · 2021: 5 · 2020: 4 · 2019: 5 · 2018: 2 · 2017: 6 · 2016: 3 · 2015: 7 · 2014: 4
- FWCI
- 3.75
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM International Conference on Information and Knowledge Management (CIKM) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Social Sciences › Education › Academic integrity and plagiarism
- Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
- Keywords
- software plagiarism detection, API call sequences, random walk with restart, Windows applications
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Software plagiarism detection: a graph-based approach. https://app.cochat.ai/papers/10.1145/2505515.2507848
- The paper
- Chae, D.-K., Ha, J., Kim, S.-W., Kang, B., & Im, E. G. (2013). Software plagiarism detection: a graph-based approach. Proceedings of the 22nd ACM international conference on Information & Knowledge Management. https://doi.org/10.1145/2505515.2507848
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.