{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:34:38Z","timestamp":1783611278326,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,26]],"date-time":"2013-01-26T00:00:00Z","timestamp":1359158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","award":["JP101405"],"award-info":[{"award-number":["JP101405"]}],"id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,1,26]]},"DOI":"10.1145\/2430553.2430557","type":"proceedings-article","created":{"date-parts":[[2013,1,29]],"date-time":"2013-01-29T16:21:18Z","timestamp":1359476478000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":100,"title":["BinSlayer"],"prefix":"10.1145","author":[{"given":"Martial","family":"Bourquin","sequence":"first","affiliation":[{"name":"University of Kent"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[{"name":"University of Kent"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edward","family":"Robbins","sequence":"additional","affiliation":[{"name":"University of Kent"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,1,26]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"DynInstAPI. http:\/\/www.dyninst.org\/dyninst.  DynInstAPI. http:\/\/www.dyninst.org\/dyninst."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029146.1029157"},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","first-page":"54","volume-title":"VMCAI","author":"Bardin S.","year":"2011","unstructured":"S. Bardin , P. Herrmann , and F. V\u00e9drine . Refinement-Based CFG Reconstruction from Unstructured Programs . In VMCAI , volume 6538 of LNCS , pages 54 -- 69 , 2011 . S. Bardin, P. Herrmann, and F. V\u00e9drine. Refinement-Based CFG Reconstruction from Unstructured Programs. In VMCAI, volume 6538 of LNCS, pages 54--69, 2011."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of Virus Bulletin International Conference 2008","author":"Briones I.","year":"2008","unstructured":"I. Briones and A. Gomez . Graphs, entropy and grid computing: Automatic comparison of malware . In Proceedings of Virus Bulletin International Conference 2008 , october 2008 . I. Briones and A. Gomez. Graphs, entropy and grid computing: Automatic comparison of malware. In Proceedings of Virus Bulletin International Conference 2008, october 2008."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of Virus Bulletin International Conference 2005","author":"Carrera E.","year":"2004","unstructured":"E. Carrera and G. Erdlyi . Digital genome mapping -- advanced binary malware analysis . In Proceedings of Virus Bulletin International Conference 2005 , october 2004 . E. Carrera and G. Erdlyi. Digital genome mapping -- advanced binary malware analysis. In Proceedings of Virus Bulletin International Conference 2005, october 2004."},{"key":"e_1_3_2_1_6_1","first-page":"61","volume-title":"Australasian Symposium on Parallel and Distributed Computing","volume":"107","author":"Cesare S.","year":"2010","unstructured":"S. Cesare and Y. Xiang . Classification of malware using structured control flow . In Australasian Symposium on Parallel and Distributed Computing , volume 107 , pages 61 -- 70 . Australian Computer Society, Inc. , 2010 . S. Cesare and Y. Xiang. Classification of malware using structured control flow. In Australasian Symposium on Parallel and Distributed Computing, volume 107, pages 61--70. Australian Computer Society, Inc., 2010."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268962"},{"key":"e_1_3_2_1_8_1","first-page":"152","volume-title":"International Conference on Information Security and Cryptology","volume":"5461","author":"Sutter B. De","year":"2008","unstructured":"B. De Sutter , B. Anckaert , J. Geiregat , D. Chanet , and K. De Bosschere . Instruction set limitation in support of software diversity . In International Conference on Information Security and Cryptology , volume 5461 , pages 152 -- 165 , 2008 . B. De Sutter, B. Anckaert, J. Geiregat, D. Chanet, and K. De Bosschere. Instruction set limitation in support of software diversity. In International Conference on Information Security and Cryptology, volume 5461, pages 152--165, 2008."},{"key":"e_1_3_2_1_9_1","volume-title":"Symposium sur la S\u00e9curit\u00e9 des Technologies de l'Information et des Communications","author":"Dullien T.","year":"2005","unstructured":"T. Dullien and R. Rolles . Graph-based comparison of executable objects . In Symposium sur la S\u00e9curit\u00e9 des Technologies de l'Information et des Communications , 2005 . T. Dullien and R. Rolles. Graph-based comparison of executable objects. In Symposium sur la S\u00e9curit\u00e9 des Technologies de l'Information et des Communications, 2005."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88625-9_16"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0141-y"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102546.1102561"},{"key":"e_1_3_2_1_13_1","first-page":"294","volume-title":"Proceedings of Virus Bulletin International Conference","author":"Gheorghescu M.","year":"2005","unstructured":"M. Gheorghescu . An automated virus classification system . In Proceedings of Virus Bulletin International Conference , pages 294 -- 300 , October 2005 . M. Gheorghescu. An automated virus classification system. In Proceedings of Virus Bulletin International Conference, pages 294--300, October 2005."},{"key":"e_1_3_2_1_14_1","volume-title":"Black Hat Federal","author":"Flake Halvar","year":"2003","unstructured":"Halvar Flake . More fun with graphs . Black Hat Federal , 2003 . Halvar Flake. More fun with graphs. Black Hat Federal, 2003."},{"key":"e_1_3_2_1_15_1","volume-title":"Black Hat Europe","author":"Flake Halvar","year":"2003","unstructured":"Halvar Flake . Graph-based binary analysis . Black Hat Europe , 2003 . www.blackhat.com\/presentations\/bh-europe-03\/bh-europe-03-halvarflake.pdf. Halvar Flake. Graph-based binary analysis. Black Hat Europe, 2003. www.blackhat.com\/presentations\/bh-europe-03\/bh-europe-03-halvarflake.pdf."},{"key":"e_1_3_2_1_16_1","first-page":"161","volume-title":"Proceedings of the IEEE Conference on Detection of Intrusions and Malware & Vulnerability Assessment - DIMVA","author":"Flake Halvar","year":"2004","unstructured":"Halvar Flake . Structural comparison of executable objects . In Proceedings of the IEEE Conference on Detection of Intrusions and Malware & Vulnerability Assessment - DIMVA , pages 161 -- 173 , 2004 . Halvar Flake. Structural comparison of executable objects. In Proceedings of the IEEE Conference on Detection of Intrusions and Malware & Vulnerability Assessment - DIMVA, pages 161--173, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653736"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278710"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103380.2103439"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27940-9_18"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2008.74"},{"issue":"1","key":"e_1_3_2_1_22_1","first-page":"100","article-title":"Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051)","volume":"2","author":"King A.","year":"2012","unstructured":"A. King , A. Mycroft , T. W. Reps , and A. Simon . Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051) . Dagstuhl Reports , 2 ( 1 ): 100 -- 116 , 2012 . A. King, A. Mycroft, T. W. Reps, and A. Simon. Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051). Dagstuhl Reports, 2(1):100--116, 2012.","journal-title":"Dagstuhl Reports"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982509"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"e_1_3_2_1_25_1","first-page":"83","volume-title":"Matching Control Flow of Program Versions. In IEEE International Conference on Software Maintenance","author":"Nagarajan V.","year":"2007","unstructured":"V. Nagarajan , X. Zhang , R. Gupta , M. Madou , B. De Sutter , and K. De Bosschere . Matching Control Flow of Program Versions. In IEEE International Conference on Software Maintenance , pages 83 -- 94 , 2007 . V. Nagarajan, X. Zhang, R. Gupta, M. Madou, B. De Sutter, and K. De Bosschere. Matching Control Flow of Program Versions. In IEEE International Conference on Software Maintenance, pages 83--94, 2007."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11815921_17"},{"key":"e_1_3_2_1_27_1","volume-title":"Black Hat USA","author":"Oh J.","year":"2009","unstructured":"J. Oh . Fight against 1-day exploits: Diffing Binaries vs Anti-diffing Binaries . In Black Hat USA , 2009 . http:\/\/www.blackhat.com\/presentations\/bh-usa-09\/OH\/BHUSA09-Oh-DiffingBinaries-PAPER.pdf. J. Oh. Fight against 1-day exploits: Diffing Binaries vs Anti-diffing Binaries. In Black Hat USA, 2009. http:\/\/www.blackhat.com\/presentations\/bh-usa-09\/OH\/BHUSA09-Oh-DiffingBinaries-PAPER.pdf."},{"key":"e_1_3_2_1_28_1","volume-title":"Black Hat USA","author":"ExploitSpotting J. Oh.","year":"2010","unstructured":"J. Oh. ExploitSpotting : Locating Vulnerabilities Out Of Vendor Patches Automatically . In Black Hat USA , 2010 . http:\/\/www.darungrim.org\/Presentations. J. Oh. ExploitSpotting: Locating Vulnerabilities Out Of Vendor Patches Automatically. In Black Hat USA, 2010. http:\/\/www.darungrim.org\/Presentations."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"e_1_3_2_1_30_1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Graph-Based Representations in Pattern Recognition","author":"Riesen K.","year":"2007","unstructured":"K. Riesen , M. Neuhaus , and H. Bunke . Bipartite graph matching for computing the edit distance of graphs . In Graph-Based Representations in Pattern Recognition , volume 4538 of Lecture Notes in Computer Science , pages 1 -- 12 . Springer , 2007 . K. Riesen, M. Neuhaus, and H. Bunke. Bipartite graph matching for computing the edit distance of graphs. In Graph-Based Representations in Pattern Recognition, volume 4538 of Lecture Notes in Computer Science, pages 1--12. Springer, 2007."},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of Black Hat DC 2007","author":"Walenstein A.","year":"2007","unstructured":"A. Walenstein , M. Venable , M. Hayes , C. Thompson , and A. Lakhotia . A. : Exploiting similarity between variants to defeat malware: vilo method for comparing and searching binary programs . In Proceedings of Black Hat DC 2007 . https:\/\/blackhat.com\/presentations\/bh-dc-07\/Walenstein\/Paper\/bh-dc-07-walenstein-WP.pdf, 2007 . A. Walenstein, M. Venable, M. Hayes, C. Thompson, and A. Lakhotia. A.: Exploiting similarity between variants to defeat malware: vilo method for comparing and searching binary programs. In Proceedings of Black Hat DC 2007. https:\/\/blackhat.com\/presentations\/bh-dc-07\/Walenstein\/Paper\/bh-dc-07-walenstein-WP.pdf, 2007."},{"key":"e_1_3_2_1_32_1","first-page":"1","article-title":"BMAT -- A Binary Matching Tool for Stale Profile Propagation","volume":"2","author":"Wang Z.","year":"2000","unstructured":"Z. Wang , K. Pierce , and S. McFarling . BMAT -- A Binary Matching Tool for Stale Profile Propagation . The Journal of Instruction-Level Parallelism , 2 : 1 -- 20 , 2000 . Z. Wang, K. Pierce, and S. McFarling. BMAT -- A Binary Matching Tool for Stale Profile Propagation. The Journal of Instruction-Level Parallelism, 2:1--20, 2000.","journal-title":"The Journal of Instruction-Level Parallelism"},{"issue":"1","key":"e_1_3_2_1_33_1","first-page":"25","volume":"2","author":"Zeng Z.","year":"2009","unstructured":"Z. Zeng , A. K. H. Tung , J. Wang , J. Feng , and L. Zhou . Comparing Stars: On Approximating Graph Edit Distance. Proceedings of the Very Large Databases , 2 ( 1 ): 25 -- 36 , Aug. 2009 . Z. Zeng, A. K. H. Tung, J. Wang, J. Feng, and L. Zhou. Comparing Stars: On Approximating Graph Edit Distance. Proceedings of the Very Large Databases, 2(1):25--36, Aug. 2009.","journal-title":"Comparing Stars: On Approximating Graph Edit Distance. Proceedings of the Very Large Databases"}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Rome Italy","acronym":"POPL '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2430553.2430557","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2430553.2430557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:23Z","timestamp":1750235723000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2430553.2430557"}},"subtitle":["accurate comparison of binary executables"],"short-title":[],"issued":{"date-parts":[[2013,1,26]]},"references-count":33,"alternative-id":["10.1145\/2430553.2430557","10.1145\/2430553"],"URL":"https:\/\/doi.org\/10.1145\/2430553.2430557","relation":{},"subject":[],"published":{"date-parts":[[2013,1,26]]},"assertion":[{"value":"2013-01-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}