The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
Semantics-Based Obfuscation-Resilient Binary Code Similarity Comparison with Applications to Software and Algorithm Plagiarism Detection
Abstract
Existing code similarity comparison methods, whether source or binary code based, are mostly not resilient to obfuscations. Identifying similar or identical code fragments among programs is very important in some applications. For example, one application is to detect illegal code reuse. In the code theft cases, emerging obfuscation techniques have made automated detection increasingly difficult. Another application is to identify cryptographic algorithms which are widely employed by modern malware to circumvent detection, hide network communications, and protect payloads among other purposes. Due to diverse coding styles and high programming flexibility, different implementation of the same algorithm may appear very distinct, causing automatic detection to be very hard, let alone code obfuscations are sometimes applied. In this paper, we propose a binary-oriented, obfuscation-resilient binary code similarity comparison method based on a new concept, longest common subsequence of semantically equivalent basic blocks , which combines rigorous program semantics with longest common subsequence based fuzzy matching. We model the semantics of a basic block by a set of symbolic formulas representing the input-output relations of the block. This way, the semantic equivalence (and similarity) of two blocks can be checked by a theorem prover. We then model the semantic similarity of two paths using the longest common subsequence with basic blocks as elements. This novel combination has resulted in strong resiliency to code obfuscation. We have developed a prototype. The experimental results show that our method can be applied to software plagiarism and algorithm detection, and is effective and practical to analyze real-world software.
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
“Cop identifies similar components between two programs by analysing semantics (behaviour) through symbolic execution.”
From Academic Source Code Plagiarism Detection by Measuring Program Behavioral Similarity (2021) · cites this paper as [35]
Citations
Cites
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Grossman, P. (2009) · Discrete Mathematics for Computing · doi:10.1007/978-0-230-37405-8_1 · Cited by 8,834
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
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
Kleinberg, J. M., & Eva Tardos, D. (2005) · Cited by 1,400
Schleimer, S., S, W. D., & Aiken, A. (2003) · Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data · doi:10.1145/872757.872770 · Cited by 1,099 · cited 1×
“Moss is a system for determining the similarity of programs based on the winnowing algorithm [63] for document fingerprinting.”
MethodAutomated Whitebox Fuzz Testing.
Godefroid, P., Levin, M. Y., & Molnar, D. A. (2008) · Cited by 1,095
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
Necula, G. C., McPeak, S., Rahul, S. P., & Weimer, W. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45937-5_16 · Cited by 977
Research works printed but not linked: 4
- conway, 1972, Unpredictable iterations, Proc Number Theory Conf, 49
- crussell, 2013, Scalable semantics-based detection of similar Android applications, Proc 18th Eur Symp Res Comput Secur, 182
- desnos, 2011, Android: From reversing to decompilation, Black Hat Abu Dhabi United Arab Emirates
- lutz, 2008, Towards revealing attackers’ intent by automatically decrypting network traffic, Master’s thesis Institut für Technische Informatik und Kommunikationsnetze ETH Zürich Zürich Switzerland
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
Self-citationαDiff: cross-version binary code similarity detection with DNN
Liu, B., Huo, W., Zhang, C., Li, W., Li, F., Piao, A., & Zou, W. (2018) · Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering · doi:10.1145/3238147.3238199 · Cited by 192
jTrans: jump-aware transformer for binary code similarity detection
Wang, H., Qu, W., Katz, G., Zhu, W., Gao, Z., Qiu, H., Zhuge, J., & Zhang, C. (2022) · Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis · doi:10.1145/3533767.3534367 · Cited by 169
A Survey of Binary Code Similarity
Haq, I. U., & Caballero, J. (2021) · ACM Computing Surveys · doi:10.1145/3446371 · Cited by 188
Identifying Open-Source License Violation and 1-day Security Risk at Large Scale
Duan, R., Bijlani, A., Xu, M., Kim, T., & Lee, W. (2017) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3133956.3134048 · Cited by 174
Metadata
- Authors
- Luo, L., Ming, J., Wu, D., Liu, P., & Zhu, S.
- Affiliations
- Pennsylvania State University (US)
- The University of Texas at Arlington (US)
- Venue
- IEEE Transactions on Software Engineering
- Published
- 2017-12-01
- Volume
- 43
- Issue
- 12
- Pages
- 1157-1177
- ISSN
- 0098-5589 (ISSN-L)
- 1939-3520
- OpenAlex
- W2579698096
- Semantic Scholar
- d86129473ebc932af4cdcf143a196e60e24fad9b
- Cited by
- 144
- References
- 69
- Citations by year
- 2026: 12 · 2025: 25 · 2024: 19 · 2023: 19 · 2022: 17 · 2021: 15 · 2020: 12 · 2019: 13 · 2018: 8 · 2017: 4
- FWCI
- 18.84
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Software Engineering (publishedVersion)
- Funders
- US National Science Foundation (CCF-1320605)
- Topics
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Physical Sciences › Computer Science › Hardware and Architecture › Security and Verification in Computing
- Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
- Keywords
- code obfuscation, obfuscation resilience, software plagiarism detection, longest common subsequence, approximate string matching, theorem proving
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: Semantics-Based Obfuscation-Resilient Binary Code Similarity Comparison with Applications to Software and Algorithm Plagiarism Detection. https://app.cochat.ai/papers/10.1109/tse.2017.2655046
- The paper
- Luo, L., Ming, J., Wu, D., Liu, P., & Zhu, S. (2017). Semantics-Based Obfuscation-Resilient Binary Code Similarity Comparison with Applications to Software and Algorithm Plagiarism Detection. IEEE Transactions on Software Engineering. https://doi.org/10.1109/tse.2017.2655046
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.