{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T18:30:47Z","timestamp":1779906647282,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003665","name":"National IT Industry Promotion Agency","doi-asserted-by":"publisher","award":["NIPA-2013-H0301-13-4009"],"award-info":[{"award-number":["NIPA-2013-H0301-13-4009"]}],"id":[{"id":"10.13039\/501100003665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["NIPA-2013-H0301-13-4009"],"award-info":[{"award-number":["NIPA-2013-H0301-13-4009"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1145\/2513228.2513300","type":"proceedings-article","created":{"date-parts":[[2013,11,15]],"date-time":"2013-11-15T19:22:39Z","timestamp":1384543359000},"page":"322-327","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Function matching-based binary-level software similarity calculation"],"prefix":"10.1145","author":[{"given":"Yeo Reum","family":"Lee","sequence":"first","affiliation":[{"name":"Hanyang University Seoul, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"BooJoong","family":"Kang","sequence":"additional","affiliation":[{"name":"Hanyang University Seoul, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eul Gyu","family":"Im","sequence":"additional","affiliation":[{"name":"Hanyang University Seoul, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2401603.2401672"},{"key":"e_1_3_2_1_2_1","unstructured":"DataRescue IDA Pro Disassembler http:\/\/www.datarescue.com\/idabase  DataRescue IDA Pro Disassembler http:\/\/www.datarescue.com\/idabase"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of Detection of Intrusions and Malware & Vulnerability Assessment","author":"Flake H.","year":"2004"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11416-011-0151-y"},{"key":"e_1_3_2_1_5_1","first-page":"547","article-title":"\u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura","volume":"37","author":"Jaccard","year":"1901","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982509"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the Malware.","author":"Tian L. M."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234183"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the Symposium sur la S'ecurit'e des Technologiesde l'Information et des Communications","author":"Dullien R."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of BlackHat","author":"Walenstein A.","year":"2007"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the Symposium on Document Analysis and Information Retrieval","author":"Cavnar J. M."},{"key":"e_1_3_2_1_12_1","first-page":"405","volume-title":"Ed.","author":"Kaufman P. J."},{"key":"e_1_3_2_1_13_1","unstructured":"Ester M. Kriegel H.-P. Sander J. and Xu X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining AAAI Press. pp. 226--231  Ester M. Kriegel H.-P. Sander J. and Xu X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining AAAI Press. pp. 226--231"},{"key":"e_1_3_2_1_14_1","unstructured":"Stanford Measure Of Software Similarity (MOSS) http:\/\/theory.stanford.edu\/~aiken\/moss\/  Stanford Measure Of Software Similarity (MOSS) http:\/\/theory.stanford.edu\/~aiken\/moss\/"}],"event":{"name":"RACS'13: Research in Adaptive and Convergent Systems","location":"Montreal Quebec Canada","acronym":"RACS'13","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing","ACCT Association of Convergent Computing Technology"]},"container-title":["Proceedings of the 2013 Research in Adaptive and Convergent Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2513228.2513300","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2513228.2513300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:27Z","timestamp":1750231707000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2513228.2513300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":14,"alternative-id":["10.1145\/2513228.2513300","10.1145\/2513228"],"URL":"https:\/\/doi.org\/10.1145\/2513228.2513300","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]},"assertion":[{"value":"2013-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}