Fast approximate matching of programs for protecting libre/open source software by using spatial indexes

SCAM 2007 - Proceedings 7th IEEE International Working Conference on Source Code Analysis and Manipulation

Volumn , Issue , 2007, Pages 111-120

  Molina, Arnoldo José Müller ^a   Shinohara, Takeshi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SERVICES; NATURAL LANGUAGE PROCESSING SYSTEMS; SOFTWARE ENGINEERING; TREES (MATHEMATICS);

APPROXIMATE MATCHING; BINARY PROGRAMS; DISTANCE FUNCTIONS; INFORMATION RETRIEVAL TECHNIQUES; INNOVATIVE APPROACHES; MATCHING PERFORMANCES; OPEN SOURCES; PROGRAM FRAGMENTS; SOFTWARE DEVELOPMENTS; SPATIAL INDICES; SYNTAX TREES;

PAPER;

COMPUTER PROGRAMS; ENGINEERING; INFORMATION RETRIEVAL; LANGUAGES; MATHEMATICS; PAPER; TREES;

EID: 47749097882     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCAM.2007.15     Document Type: Conference Paper

References (48)

1. http://lucene.apache.org/.
2. http://sandmark.cs.arizona.edu/index.html.
3. http://www.catb.org/ẽsr/comparator/.
4. http://www.fsf.org/licensing/licenses/ and http://gplviolations.org/.
5. http://www.jpackage.org/.
6. http://www.zelix.com.
7. N. Augsten, M. Bhlen, and J. Gamper. Approximate matching of hierarchical data using pq-grams. In VLDB '05: Proceedings of the 31st International Conference on Very Large Databases, pages 301-312. VLDB Endowment, 2005.
8. R. A. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1999.
9. B. S. Baker and U. Manber. Deducing similarities in java sources from bytecodes. In Proc. of Usenix Annual Technical Conf., pages 179-190, 1998.
10. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology - CRYPTO, pages 1-18, 2001.
11. I. D. Baxter, A. Yahin, L. M. D. Moura, M. Sant'Anna, and L. Bier. Clone detection using abstract syntax trees. In ICSM, pages 368-377, 1998.
12. S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, editors, Proceedings of the 22nd International Conference on Very Large Databases, pages 28-39, San Francisco, U.S.A., 1996. Morgan Kaufmann Publishers.
13. S. S. Chawathe. Comparing hierarchical data in external memory. In VLDB '99: Proceedings of the 25th International Conference on Very Large Data Bases, pages 90-101, San Francisco, CA, USA, 1999. Morgan Kaufmann Publishers Inc.
14. M. Christodorescu and S. Jha. Static analysis of executables to detect malicious patterns. 12th USENIX Security Symposium, pages 169-186, 2003.
15. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, pages 426-435, 1997.
16. C. Collberg and C. Thomborson. Software watermarking: Models and dynamic embeddings. In Principles of Programming Languages 1999, POPL'99, pages 311-324, 1999.
17. C. S. Collberg, C. D. Thomborson, and D. Low. Breaking abstractions and unstructuring data structures. In International Conference on Computer Languages, pages 28-38, 1998.
18. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst., 13(4):451-490, 1991.
19. E. Demaine, S. Mosez, B. Rossman, and O. Weimann. An optimal decomposition algorithm for tree edit distance. In www.mit.edu/oweimann/, 2005.
20. T. Dullien and R. Rolles. Graph-based comparison of executable objects. In SSTIC, 2005.
21. S. Guha, H. V. Jagadish, N. Koudas, D. Srivastava, and T. Yu. Approximate xml joins. In SIGMOD '02: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pages 287-298, New York, NY, USA, 2002. ACM Press.
22. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD '84: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pages 47-57, New York, NY, USA, 1984. ACM Press.
23. S. Horwitz. Identifying the semantic and textual differences between two versions of a program. In PLDI '90: Proceedings of the ACM SIGPLAN 1990 conference on Programming Language Design and Implementation, pages 234-245, New York, NY, USA, 1990. ACM Press.
24. K. Kailing, H.-P. Kriegel, S. Schoenauer, and T. Seidl. Efficient similarity search for hierarchical data in large databases. In EDBT 2004, pages 676-693, 2004.
25. A. Kiss, J. Jasz, G. Lehotai, and T. Gyimothy. Interprocedural static slicing of binary executables. SCAM, 00:118, 2003.
26. R. Komondoor and S. Horwitz. Using slicing to identify duplication in source code. Proceedings of the 8th International Symposium on Static Analysis, 2126:40-60, 2001.
27. W. Landi. Undecidability of static analysis. ACM Lett. Program. Lang. Syst., 1(4):323-337, 1992.
28. W. M. YAP3: Improved detection of similarities in computer program and other texts. SIGCSEB: SIGCSE Bulletin, 28:130-134, 1996.
29. A. Monden, H. Iida, K. Matsumoto, K. Inoue, and K. Torii. A practical method for watermarking java programs. In compsac2000, 24th Computer Software and Applications Conference, pages 191-197, 2000.
30. A. Müller and T. Shinohara. On approximate matching of programs for protecting libre software. In CASCON '06: Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative Research, pages 275-289, New York, NY, USA, 2006. ACM Press.
31. E. M. Myers. A precise inter-procedural data flow algorithm. In POPL '81: Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 219-230, New York, NY, USA, 1981. ACM Press.
32. N. Ohkura, K. Hirata, T. Kuboyama, and M. Harao. The q-gram distance for ordered unlabeled trees. In Discovery Science (8th international conference), pages 189-202, 2004.
33. L. Prechelt, G. Malpohl, and M. Philippsen. Finding plagiarism among a set of programs with jplag. Journal of Universal Computer Science, 8(11):1016-1038, 2002.
34. T. Seidl and H.-P. Kriegel. Optimal multi-step k-nearest neighbor search. In SIGMOD '98: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pages 154-165, New York, NY, USA, 1998. ACM Press.
35. T. Shinohara and H. Ishizaka. On dimension reduction mappings for approximate retrieval of multi-dimensional data. In Progress in Discovery Science, Final Report of the Japanese Discovery Science Project, pages 224-231, London, UK, 2002. Springer-Verlag.
36. K. T., K. S., and I. K. Ccfinder: A multilinguistic token-based code clone detection system for large scale source code. In IEEE Transactions on Software Engineering 28(7), pages 654-670, 2002.
37. K.-C. Tai. The tree-to-tree correction problem. J. ACM, 26(3):422-433, 1979.
38. H. Tamada, M. Nakamura, A. Monden, and K. ichi Matsumoto. Detecting the theft of programs using birthmarks. Information Science Technical Report, 2003.
39. H. Tamada, M. Nakamura, A. Monden, and K. ichi Matsumoto. A method for extracting program fingerprints from java class files. The Institute of Electronics, Information and Communication Engineers Technical Report, ISEC2003-29:127-133, 2003.
40. H. Tamada, M. Nakamura, A. Monden, and K.-i. Matsumoto. Java birthmarks: Detecting the software theft. IEICE Trans Inf Syst, E88-D(9):2148-2158, 2005.
41. H. Tamada, K. Okamoto, M. Nakamura, A. Monden, and K. ichi Matsumoto. Dynamic software birthmarks to detect the theft of windows applications. International Symposium on Future Software Technology 2004 (ISFST 2004), 2004.
42. H. Touzet. A linear tree edit distance algorithm for similar ordered trees. In Lecture Notes in Computer Science, volume 3537, pages 334-345, 2005.
43. F. Umemori, K. Konda, R. Yokomori, and K. Inoue. Design and implementation of bytecode-based java slicing system. SCAM, 00:108-117, 2003.
44. R. Vall-Rai, L. Hendren, V. Sundaresan, P. Lam, E. Gagnon, and P. Co. Soot - a java optimization framework. CASCON99, pages 13-24, 1999.
45. R. van Engelen, D. Whalley, and X. Yuan. Automatic validation of code-improving transformations on low-level program representations. Sci. Comput. Program., 52(1-3):257-280, 2004.
46. A. Walenstein, R. Mathur, M. R. Chouchane, and A. Lakhotia. Normalizing metamorphic malware using term rewriting. In SCAM '06: Proceedings of the Sixth IEEE International Workshop on Source Code Analysis and Manipulation, pages 75-84, Washington, DC, USA, 2006. IEEE Computer Society.
47. M. Weiser. Program slicing. IEEE Transactions on Software Engineering, pages 352-357, 1984.
48. R. Yang, P. Kalnis, and A. K. H. Tung. Similarity evaluation on tree-structured data. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pages 754-765, 2005.