JavaScript programs are always under the threat of being copied. Most browsers provide the way to access the code of JavaScript program so it is easily obtainable. Hence it is mandatory to protect the software. Watermarking and code obfuscation are the techniques used to safeguard the software. A Watermark cannot completely protect the code by getting stolen because a potential attacker can easily remove it. Code obfuscation cannot avoid code from being stolen; it only prevents others by understanding the logic of the program. A birthmark of the JavaScript program is the unique characteristics that it possesses. Heap Graph is used to depict the behaviour of a program as how it calls other objects so as to fulfil the desired functionality. It requires efficient merging of heap graphs generated at various points of time. For that agglomerative clustering can be used. Frequent Subgraph Mining is used to find the subgraph that represents the unique behaviour of the program. At the end, the subgraph of genuine program is searched in the graph of the suspected program. Our aim is to survey about the system that can protect the JavaScript programs from being stolen.

1. P. Chan, L. Hui, and S. Yiu. Dynamic software birthmark for java based on heap memory analysis. In Springer-Verlag, editor, IFIP TC 6/TC 11 Int. Conf. Commun. and Multimedia Security(CMS11), vol. 12, pages 94–106, Berlin, Heidelberg, 2011.
2. P. Chan, L. Hui, and S. Yiu. Jsbirth: Dynamic JavaScript birthmark based on the run-time heap. In 2011 IEEE 35th Annual Computer Software and Application Conference (COMPSAC),pages 407–412, July 2011.
3. C. Collberg, E. Carter, S. Debray, A. Huntwork, J. Kececioglu,C. Linn, and M. Stepp. Dynamic path-based software watermarking. In ACM, editor, Programming Language Design and Implementation (PLDI 04), pages 107–118, New York, 2004.
4. C. Collberg, C. Thomborson, and D. Low. Taxonomy of obfuscating transformations. Technical Report 148, University of Auckland, Auckland, New Zealand, 2003.
5. Christian Collberg and Clark Thomborson. Software watermarking: models and dynamic embeddings. Technical report, Department of Computer Science, University of Auckland, Private Bag 92091, Auckland, New Zealand, 2003.
6. Pasi Franti, Olli Virmajoki, and Ville Hautamaki. Fast agglomerative clustering using a k-nearest neighbour graph. In IEEE Transactions on Pattern Analysis AND Machine Intelligence, number 11 in vol. 28, pages 1875–1881, November 2006.
7. G. Myles and C. Collberg. Detecting software theft via whole program path birthmarks. In Inf. Security 7th Int. Conf. (ISC2004), pages 404–414, Palo Alto, CA, September 2004.
8. H. Tamada, K. Okamoto, and K. Matsumoto. Design and evaluation of dynamic software birthmarks based on API calls. Technical report, Graduate School of Information Science, Nara Institute of Science and Technology, 8916-5 Takayamacho, Ikoma-shi, Nara, 6300101 Japan, 2007.
9. Michihiro Kuramochi and George Karypis. An efficient algorithm for discovering frequent subgraphs. In IEEE Transactions on Knowledge and Data Engineering, number 9 in vol. 16,pages 1038–1051, September 2004.
10. Akito Monden, Hajimu Lida, Ken ichi Matsumoto, Katsuro Inoue, and Koji Torii. Watermarking java programs. In International Symposium of Future Software Technology, Nanjing, China, 1999.
11. Ginger Myles and Christian Collberg. K-gram based software birthmarks. In ACM, editor, Symposium on Application Computing (SAC 05), pages 314–318, 2005.
12. P. Chan, L. Hui, and S. Yiu. Heap graph based software theft detection. IEEE Transaction On Information Forensics and Security, pages 101–110, January 2013.
13. D. Schuler, V. Dallmeier, and C. Lindig. A dynamic birthmark for java. In IEEE/ACM International Conference of Automated Software Engineering (ASE 07), volume 22, pages 274–283, New York, 2007.

Dynamic Birthmark Agglomerative Clustering Frequent Subgraph Mining Theft Identification