Deviation-Based Obfuscation-Resilient Program Equivalence Checking With Application to Software Plagiarism Detection
The DOI matches its Crossref record; 71 of the 76 references it cites were found in a registry or an index.
Abstract
Software plagiarism, an act of illegally copying others' code, has become a serious concern for honest software companies and the open source community. Considerable research efforts have been dedicated to searching the evidence of software plagiarism. In this paper, we continue this line of research and propose LoPD, a deviation-based program equivalence checking approach, which is an ideal fit for the whole-program plagiarism detection. Instead of directly comparing the similarity between two programs, LoPD searches for any dissimilarity between two programs by finding an input that will cause these two programs to behave differently, either with different output states or with semantically different execution paths. As long as we can find one dissimilarity, the programs are semantically different; but if we cannot find any dissimilarity, it is more likely a plagiarism case. We leverage dynamic symbolic execution to capture the semantics of execution paths and to find path deviations. Compared to the existing detection approaches, LoPD's formal program semantics-based method is more resilient to automatic obfuscation schemes. Our evaluation results indicate that LoPD is effective in detecting whole-program plagiarism. Furthermore, we demonstrate that LoPD can be applied to partial software plagiarism detection as well. The encouraging experiment results show that LoPD is an appealing complement to existing software plagiarism detection approaches.
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
“LoPD identifies the similarity of programs based on their implemented program logic to determine if they are semantically equivalent.”
From Academic Source Code Plagiarism Detection by Measuring Program Behavioral Similarity (2021) · cites this paper as [54]
Citations
Cites
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595 · cited 1×
“, STP [58] and Z3 [59]) is usually used to generate the input that satisfies the corresponding path constraints.”
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
Symbolic execution and program testing
King, J. C. (1976) · Communications of the ACM · doi:10.1145/360248.360252 · Cited by 3,031
LLVM: A compilation framework for lifelong program analysis & transformation
Lattner, C., & Adve, V. (2004) · International Symposium on Code Generation and Optimization, 2004. CGO 2004. · doi:10.1109/cgo.2004.1281665 · Cited by 2,681
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
Cadar, C., Dunbar, D., & Engler, D. (2008) · doi:10.5555/1855741.1855756 · Cited by 2,620
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
CCFinder: a multilinguistic token-based code clone detection system for large scale source code
Kamiya, T., Kusumoto, S., & Inoue, K. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1019480 · Cited by 1,711
CUTE: a concolic unit testing engine for C
Sen, K., Marinov, D., & Agha, G. (2005) · Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/1081706.1081750 · Cited by 1,651
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065036 · Cited by 1,570
Cited by
Neural Machine Translation Inspired Binary Code Similarity Comparison beyond Function Pairs
Zuo, F., Li, X., Young, P., Luo, L., Zeng, Q., & Zhang, Z. (2019) · Proceedings 2019 Network and Distributed System Security Symposium · doi:10.14722/ndss.2019.23492 · Cited by 175
“, code similarity comparison beyond function pairs, which has been emphasized by previous work [27], [37], [43], [68], [26], [60], [61](, although they can only work for code of the same ISA).”
BackgroundLuo, L., Ming, J., Wu, D., Liu, P., & Zhu, S. (2017) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2017.2655046 · Cited by 144
“[55], [79] presented a program logic based approach which searches for dissimilarity between two programs by finding path deviations.”
BackgroundSelf-citationA blockchain-based code copyright management system
Jing, N., Liu, Q., & Sugumaran, V. (2021) · Information Processing & Management · doi:10.1016/j.ipm.2021.102518 · Cited by 140
Kim, D., Kim, E., Kil, S., Son, S., & Kim, Y. (2022) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2022.3187689 · Cited by 164
“The symbolic constraints could express the output variables or states of a basic block [7], a program slice [16], [59], [63], or a path [8], [79], [80].”
BackgroundAutomatic Grading of Programming Assignments: An Approach Based on Formal Semantics
Liu, X., Wang, S., Wang, P., & Wu, D. (2019) · IEEE/ACM International Conference on Software Engineering: Software Engineering Education and Training (ICSE-SEET) · doi:10.1109/icse-seet.2019.00022 · Cited by 107
“Our idea is to efficiently search for semantic differences between a student’s submission and the reference implementation by detecting Path Deviation [16]–[18].”
MethodSelf-citation
Metadata
- Authors
- Ming, J., Zhang, F., Wu, D., Liu, P., & Zhu, S.
- Affiliations
- Pennsylvania State University (US)
- Venue
- IEEE Transactions on Reliability
- Published
- 2016-12
- Volume
- 65
- Issue
- 4
- Pages
- 1647-1664
- ISSN
- 0018-9529 (ISSN-L)
- 1558-1721
- OpenAlex
- W2432058664
- Semantic Scholar
- cef283e8a74eed398ce164d455d787f1f21b7ed0
- Cited by
- 33
- References
- 76
- Citations by year
- 2025: 1 · 2024: 6 · 2023: 1 · 2022: 3 · 2021: 4 · 2020: 6 · 2019: 3 · 2018: 1 · 2017: 7 · 2016: 1
- FWCI
- 8.90
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Reliability (publishedVersion)
- Funders
- National Science Foundation (CCF-1320605, CNS-1223710, CNS-1422594, CNS-1505664)
- Office of Naval Research (N00014-13-1-0175, N00014-16-1-2265)
- ARO (W911NF-09-1-0525, W911NF-13-1-0421)
- Topics
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
- Social Sciences › Education › Academic integrity and plagiarism
- Keywords
- software plagiarism detection, program equivalence checking, obfuscation resilience, dynamic symbolic execution, program semantics
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.