{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T10:18:52Z","timestamp":1729678732849,"version":"3.28.0"},"reference-count":48,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1109\/scam.2007.15","type":"proceedings-article","created":{"date-parts":[[2008,4,28]],"date-time":"2008-04-28T12:50:08Z","timestamp":1209387008000},"page":"111-122","source":"Crossref","is-referenced-by-count":1,"title":["Fast Approximate Matching of Programs for Protecting Libre\/Open Source Software by Using Spatial Indexes"],"prefix":"10.1109","author":[{"given":"Arnoldo Jose Muller","family":"Molina","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Shinohara","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","article-title":"A method for extracting program fingerprints from java class files","author":"tamada","year":"2003","journal-title":"The Institute of Electronics Information and Communication Engineers Technical Report ISEC2003-29 127-133"},{"key":"ref38","article-title":"Detecting the theft of programs using birthmarks","author":"tamada","year":"2003","journal-title":"Information Science Technical Report"},{"key":"ref33","first-page":"1016","article-title":"Finding plagiarism among a set of programs with jplag","volume":"8","author":"prechelt","year":"2002","journal-title":"Journal of Universal Computer Science"},{"key":"ref32","first-page":"189","article-title":"The q-gram distance for ordered unlabeled trees","author":"ohkura","year":"2004","journal-title":"Discovery Science (8th international conference)"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1145\/567532.567556"},{"key":"ref30","first-page":"275","article-title":"On approximate matching of programs for protecting libre software","author":"m\u00fcller","year":"2006","journal-title":"Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research - CASCON '06"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1145\/322139.322143"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1109\/TSE.2002.1019480","article-title":"A multilinguistic token-based code clone detection system for large scale source code","volume":"28","author":"ccfinder","year":"2002","journal-title":"IEEE Transactions on Software Engineering"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1007\/3-540-45884-0_14"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1145\/276304.276319"},{"key":"ref10","first-page":"1","article-title":"On the (im)possibility of obfuscating programs","author":"barak","year":"2001","journal-title":"Advances in Cryptology-CR YPTO '99"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1093\/ietisy\/e88-d.9.2148"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/ICSM.1998.738528"},{"key":"ref12","first-page":"28","article-title":"The X-tree: An index structure for high-dimensional data","author":"berchtold","year":"1996","journal-title":"Proceedings of the 22nd International Conference on Very Large Databases"},{"key":"ref13","first-page":"90","article-title":"Comparing hierarchical data in external memory","author":"chawathe","year":"1999","journal-title":"VLDB ‘99 Proceedings of the 25th International Conference on Very Large Data Bases"},{"key":"ref14","first-page":"169","article-title":"Static analysis of executables to detect malicious patterns","author":"christodorescu","year":"2003","journal-title":"12th USENIX Security Sympo-sium"},{"key":"ref15","first-page":"426","article-title":"M-tree: An efficient access method for similarity search in metric spaces","author":"ciaccia","year":"1997","journal-title":"VLDB"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/292540.292569"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/ICCL.1998.674154"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1145\/115372.115320"},{"year":"2005","author":"demaine","journal-title":"An optimal decomposition algorithm for tree edit distance","key":"ref19"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/236462.236525","article-title":"3: Improved detection of similarities in computer program and other texts","volume":"28","author":"yap","year":"1996","journal-title":"SIGCSEB SIGCSE Bulletin"},{"year":"0","key":"ref4"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1145\/161494.161501"},{"year":"0","key":"ref3"},{"year":"0","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/CMPSAC.2000.884716"},{"year":"0","key":"ref5"},{"year":"1999","author":"baeza-yates","journal-title":"Modern Information Retrieval","key":"ref8"},{"key":"ref7","first-page":"301","article-title":"Approximate matching of hierarchical data using pq-grams","author":"augsten","year":"2005","journal-title":"VLDB '05 Proceedings of the 31 st International Conference on Very Large Databases"},{"year":"0","key":"ref2"},{"key":"ref9","first-page":"179","article-title":"Deducing similarities in java sources from bytecodes","author":"baker","year":"1998","journal-title":"Proc of USENIX Annual Technical Conf"},{"year":"0","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1109\/SCAM.2006.20"},{"key":"ref20","article-title":"Graph-based comparison of executable objects","author":"dullien","year":"2005","journal-title":"SSTIC"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1016\/j.scico.2004.03.008"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1145\/1066157.1066243"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/602259.602266"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1109\/TSE.1984.5010248"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/564691.564725"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1007\/11496656_29"},{"key":"ref24","first-page":"676","article-title":"Efficient similarity search for hierarchical data in large databases","author":"kailing","year":"2004","journal-title":"EDBT 2004"},{"key":"ref41","article-title":"Dynamic software birthmarks to detect the theft of windows applications","author":"tamada","year":"2004","journal-title":"International Symposium on Future Software Technology 2004 (ISFST 2004)"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1145\/93542.93574"},{"key":"ref44","first-page":"13","article-title":"Soot - a java optimization framework","author":"vall-rai","year":"1999","journal-title":"CAS-CON99"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-47764-0_3","article-title":"Using slicing to identify duplication in source code","volume":"2126","author":"komondoor","year":"2001","journal-title":"8th International Symposium on Static Analysis"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1109\/SCAM.2003.1238037"},{"key":"ref25","first-page":"118","article-title":"Interproce-dural static slicing of binary executables","volume":"0","author":"kiss","year":"2003","journal-title":"SCAM"}],"event":{"name":"2007 7th IEEE International Working Conference on Source Code Analysis and Manipulation - SCAM '07","start":{"date-parts":[[2007,9,30]]},"location":"Paris","end":{"date-parts":[[2007,10,1]]}},"container-title":["Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2007)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4362882\/4362883\/04362903.pdf?arnumber=4362903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T21:54:36Z","timestamp":1631138076000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4362903\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/scam.2007.15","relation":{},"subject":[],"published":{"date-parts":[[2007,9]]}}}