{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T22:13:50Z","timestamp":1769724830857,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,19]],"date-time":"2009-07-19T00:00:00Z","timestamp":1247961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,19]]},"DOI":"10.1145\/1572272.1572287","type":"proceedings-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T12:45:28Z","timestamp":1248785128000},"page":"117-128","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":113,"title":["Detecting code clones in binary executables"],"prefix":"10.1145","author":[{"given":"Andreas","family":"S\u00e6bj\u00f8rnsen","sequence":"first","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}]},{"given":"Jeremiah","family":"Willcock","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]},{"given":"Thomas","family":"Panas","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA, USA"}]},{"given":"Daniel","family":"Quinlan","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA, USA"}]},{"given":"Zhendong","family":"Su","sequence":"additional","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"IDA Pro disassembler. http:\/\/www.datarescue.com.  IDA Pro disassembler. http:\/\/www.datarescue.com."},{"key":"e_1_3_2_1_2_1","unstructured":"JPlag. http:\/\/www.jplag.de.  JPlag. http:\/\/www.jplag.de."},{"key":"e_1_3_2_1_3_1","volume-title":"E2LSH: Exact Euclidean locality-sensitive hashing. Web: http:\/\/www.mit.edu\/~andoni\/LSH\/","author":"Andoni A.","year":"2004","unstructured":"A. Andoni and P. Indyk . E2LSH: Exact Euclidean locality-sensitive hashing. Web: http:\/\/www.mit.edu\/~andoni\/LSH\/ , 2004 . A. Andoni and P. Indyk. E2LSH: Exact Euclidean locality-sensitive hashing. Web: http:\/\/www.mit.edu\/~andoni\/LSH\/, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793246707"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081733"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/998675.999466"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11790754_8"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 2003 USENIX Security Symposium. USENIX","author":"Christodorescu M.","year":"2003","unstructured":"M. Christodorescu and S. Jha . Static analysis of executables to detect malicious patterns. In USENIX, editor , Proceedings of the 2003 USENIX Security Symposium. USENIX , 2003 . M. Christodorescu and S. Jha. Static analysis of executables to detect malicious patterns. In USENIX, editor, Proceedings of the 2003 USENIX Security Symposium. USENIX, 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007512.1007518"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2005.20"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368132"},{"key":"e_1_3_2_1_13_1","first-page":"518","volume-title":"Very Large Data Bases","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani . Similarity search in high dimensions via hashing . In Very Large Data Bases , pages 518 -- 529 , San Francisco, CA , USA, 1999 . Morgan Kaufmann Publishers Inc . A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In Very Large Data Bases, pages 518--529, San Francisco, CA, USA, 1999. Morgan Kaufmann Publishers Inc."},{"key":"e_1_3_2_1_14_1","unstructured":"A. Hemel. The GPL compliance engineering guide. http:\/\/www.loohuis-consulting.nl\/downloads\/compliance-manual.pdf.  A. Hemel. The GPL compliance engineering guide. http:\/\/www.loohuis-consulting.nl\/downloads\/compliance-manual.pdf."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.30"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2002.1019480"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647170.718283"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11663812_11"},{"key":"e_1_3_2_1_20_1","first-page":"20","volume-title":"OSDI","author":"Li Z.","year":"2004","unstructured":"Z. Li , S. Lu , S. Myagmar , and Y. Zhou . CP-Miner: a tool for finding copy-paste and related bugs in operating system code . In OSDI , pages 20 -- 20 , 2004 . Z. Li, S. Lu, S. Myagmar, and Y. Zhou. CP-Miner: a tool for finding copy-paste and related bugs in operating system code. In OSDI, pages 20--20, 2004."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45213-3_27"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321672"},{"issue":"9","key":"e_1_3_2_1_24_1","first-page":"64","article-title":"Finding binary clones with opstrings and function digests","volume":"30","author":"Schulman A.","year":"2005","unstructured":"A. Schulman . Finding binary clones with opstrings and function digests . Doctor Dobb's J , 30 ( 9 ): 64 -- 70 , 2005 . A. Schulman. Finding binary clones with opstrings and function digests. Doctor Dobb's J, 30(9):64--70, 2005.","journal-title":"Doctor Dobb's J"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4908.001.0001","volume-title":"Nearest-Neighbor Methods in Learning and Vision: Theory and Practice","author":"Shakhnarovich G.","year":"2006","unstructured":"G. Shakhnarovich , T. Darrell , and P. Indyk . Nearest-Neighbor Methods in Learning and Vision: Theory and Practice . The MIT Press , 2006 . G. Shakhnarovich, T. Darrell, and P. Indyk. Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. The MIT Press, 2006."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2004.5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315261"}],"event":{"name":"ISSTA '09: International Symposium on Software Testing and Analysis","location":"Chicago IL USA","acronym":"ISSTA '09","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery","SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the eighteenth international symposium on Software testing and analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1572272.1572287","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1572272.1572287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:29Z","timestamp":1750249409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1572272.1572287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,19]]},"references-count":27,"alternative-id":["10.1145\/1572272.1572287","10.1145\/1572272"],"URL":"https:\/\/doi.org\/10.1145\/1572272.1572287","relation":{},"subject":[],"published":{"date-parts":[[2009,7,19]]},"assertion":[{"value":"2009-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}