Heap Graph Based Software Theft Detection
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
As JavaScript is becoming more and more popular, JavaScript programs are valuable assets to many companies. However, the source code of JavaScript programs can be easily obtained and plagiarism of JavaScript programs is a serious threat to the industry. There are techniques like code obfuscation and watermarking which can make the source code of a program difficult to understand by humans and prove the ownership of the program. However, code obfuscation cannot avoid the source code being copied and a watermark can be defaced. In this paper, we use a relatively new technique, software birthmark, to help detect code theft of JavaScript programs. A birthmark is a unique characteristic a program possesses that can be used to identify the program. We extend two recent birthmark systems that extract the birthmark of a software from the run-time heap. We propose a redesigned system with improved robustness and performed extensive experiments to justify the effectiveness and robustness of it. Our evaluation based on 200 large-scale websites showed that our birthmark system exhibits 100% accuracy. We remark that it is solid and ready for practical use.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
A Taxonomy of Obfuscating Transformations
Collberg, C. S., Thomborson, C. D., & Low, D. (1997) · ResearchSpace (University of Auckland) · Cited by 1,090
Software watermarking: models and dynamic embeddings
Collberg, C., & Thomborson, C. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292569 · Cited by 342
Performance evaluation of the VF graph matching algorithm
Cordella, L. P., Foggia, P., Sansone, C., & Vento, M. (2003) · Proceedings 10th International Conference on Image Analysis and Processing · doi:10.1109/iciap.1999.797762 · Cited by 226
K-gram based software birthmarks
Myles, G., & Collberg, C. (2005) · Proceedings of the 2005 ACM symposium on Applied computing · doi:10.1145/1066677.1066753 · Cited by 187
Dynamic path-based software watermarking
Collberg, C. S., Carter, E., Debray, S., Huntwork, A., Kececioglu, J. D., Linn, C., & Stepp, M. (2004) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/996841.996856 · Cited by 152
Detecting Software Theft via Whole Program Path Birthmarks
Myles, G., & Collberg, C. S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30144-8_34 · Cited by 144
Design and evaluation of birthmarks for detecting theft of Java programs
Tamada, H., Nakamura, M., & Monden, A. (2004) · Cited by 129
Schuler, D., Dallmeier, V., & Lindig, C. (2007) · Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering · doi:10.1145/1321631.1321672 · Cited by 108
Dynamic Software Birthmarks to Detect the Theft of Windows Applications
Tamada, H., Okamoto, K., Nakamura, M., Monden, A., & Matsumoto, K. (2004) · Cited by 107
Behavior based software theft detection
Wang, X., Jhi, Y.-C., Zhu, S., & Liu, P. (2009) · Proceedings of the 16th ACM conference on Computer and communications security · doi:10.1145/1653662.1653696 · Cited by 101 · cited 2×
“It depends solely on the intrinsic characteristics of a program to determine the similarity between two programs [6]–[13].”
BackgroundMethod
Research works printed but not linked: 10
- tamada, 2003, Detecting the theft of programs using birthmarks
- team, 0, Prototype JavaScript framework
- proietti, 0, Mootools JavaScript Framework
- 0, Google Chromium Project
- 0, Google v8 JavaScript Engine
- monden, 1999, Watermarking java programs, Proc Int l Symp Future Software Technology
- data, 2008, JavaScript Dominates EMEA Development
- 0, VFLib
- 0, Jasob 3
- 0, Content Scripts
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
“usage patterns [39], heap structures [40], and API method call sequences [33], [41].”
Method
Metadata
- Authors
- Chan, P. P. F., Hui, L. C. K., & Yiu, S. M.
- Affiliations
- University of Hong Kong (HK)
- ORCID
- Yiu, S. M.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2013-01
- Volume
- 8
- Issue
- 1
- Pages
- 101-110
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2120724609
- Cited by
- 32
- References
- 15
- Citations by year
- 2025: 1 · 2021: 2 · 2020: 4 · 2019: 1 · 2018: 3 · 2017: 5 · 2016: 7 · 2015: 4 · 2014: 5
- FWCI
- 7.82
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Information Forensics and Security (publishedVersion)
- The HKU Scholars Hub (University of Hong Kong) (submittedVersion)
- Funders
- University of Hong Kong
- Hong Kong Government
- Topics
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
- Physical Sciences › Computer Science › Hardware and Architecture › Security and Verification in Computing
- Keywords
- software birthmarks, JavaScript, plagiarism detection, software watermarking, code obfuscation, program identification
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: Heap Graph Based Software Theft Detection. https://app.cochat.ai/papers/10.1109/tifs.2012.2223685
- The paper
- Chan, P. P. F., Hui, L. C. K., & Yiu, S. M. (2013). Heap Graph Based Software Theft Detection. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2012.2223685
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.