On approximate matching of programs for protecting libre software

Proceedings of the 2006 Conference of the Center for Advanced Studies on Collaborative Research, CASCON '06

Volumn , Issue , 2006, Pages

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

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE MATCHING; CODE PROGRAMS; COMMERCIAL GRADE; CONTROL FLOWS; DISTANCE FUNCTIONS; LIBRE SOFTWARE; OPEN SOURCE DEVELOPMENT; OPEN SOURCES; RAPID IDENTIFICATION;

DISTRIBUTED COMPUTER SYSTEMS; JAVA PROGRAMMING LANGUAGE;

COMPUTER SOFTWARE;

EID: 77952410052     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1188966.1188994     Document Type: Conference Paper

References (28)

1. http://jmusic.ci.qut.edu.au/.
2. http://q-lang.sourceforge.net.
3. http://www.fsf.org/
4. http://www.fsf.org/licensing/licenses/ and http://gpl-violations.org/.
5. http://www.gnu.org/software/binutils/.
6. http://www.leesw.com/smokescreen/.
7. http://www.zelix.com.
8. Brenda S. Baker and Udi Manber. Deducing similarities in java sources from bytecodes. In Proc. of Usenix Annual Technical Conf., pages 179-190, 1998.
9. Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang. On the (im)possibility of obfuscating programs. In Advances in Cryptology-CRYPTO, 2001.
10. Ira D. Baxter, Andrew Yahin, Leonardo M. De Moura, Marcelo Sant'Anna, and Lorraine Bier. Clone detection using abstract syntax trees. In ICSM, pages 368-377, 1998.
11. Wayne D. Blizard. Multiset theory. Notre Dame journal of formal logic, 30(1):36-66, 1989.
12. M. Christodorescu and S. Jha. Static analysis of executables to detect malicious patterns. 12th USENIX Security Symposium, pages 169-186, 2003.
13. Christian Collberg and Clark Thomborson. Software watermarking: Models and dynamic embeddings. In Principles of Programming Languages 1999, POPL'99, pages 311-324, 1999.
14. Christian Collberg, Clark Thomborson, and Douglas Low. Manufacturing cheap, resilient, and stealthy opaque constructs. In Principles of Programming Languages 1998, POPL'98, pages 184-196, 1998.
15. Christian S. Collberg, Clark D. Thomborson, and Douglas Low. Breaking abstractions and unstructuring data structures. In International Conference on Computer Languages, pages 28-38, 1998.
16. R Cytron, J Ferrante, BK Rosen, and MN Wegman. Efficiently computing static single assignment form and the control flow dependence graph. ACM Symposium on Principles of Programming Languages, 1989.
17. Edsger Wybe Dijkstra. A Discipline of Programming. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1997.
18. Oliver Gnther. Efficient computation of spatial joins. In Proceedings of the Ninth International Conference on Data Engineering, pages 50-59, Washington, DC, USA, 1993. IEEE Computer Society.
19. Susan 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.
20. Justin Pappas Johnson. Economics of open source software, 2000.
21. Asif Khalak. Economic model for impact of open source software, 2000.
22. Raghavan Komondoor and Susan Horwitz. Using slicing to identify duplication in source code. Lecture Notes in Computer Science, 2126:40-60, 2001.
23. C. Kruegel, W. Robertson, F. Valeur, and G. Vigna. Static disassembly of obfuscated binaries. pages 255-270, 2004.
24. William Landi. Undecidability of static analysis. ACM Lett. Program. Lang. Syst., 1(4):323-337, 1992.
25. Douglas Low. Java Control Flow Obfuscation. PhD thesis, University of Auckland, Auckland, New Zealand, 1998.
26. Wise M. YAP3: Improved detection of similarities in computer program and other texts. SIGCSEB: SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education), 28, 1996.
27. A. Monden, H. Iida, K. Matsumoto, Katsuro Inoue, and Koji Torii. A practical method for watermarking java programs. In compsac2000, 24th Computer Software and Applications Conference, 2000.
28. Eugene M. Myers. A precise interprocedural 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