{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T08:37:28Z","timestamp":1771576648565,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T00:00:00Z","timestamp":1529280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"US Office of Naval Research","award":["N00014-15-1-2210 and N00014-17-1- 2786"],"award-info":[{"award-number":["N00014-15-1-2210 and N00014-17-1- 2786"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,18]]},"DOI":"10.1145\/3211346.3211347","type":"proceedings-article","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T19:49:37Z","timestamp":1528400977000},"page":"11-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Clone-hunter: accelerated bound checks elimination via binary code clone detection"],"prefix":"10.1145","author":[{"given":"Hongfa","family":"Xue","sequence":"first","affiliation":[{"name":"George Washington University, USA"}]},{"given":"Guru","family":"Venkataramani","sequence":"additional","affiliation":[{"name":"George Washington University, USA"}]},{"given":"Tian","family":"Lan","sequence":"additional","affiliation":[{"name":"George Washington University, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"SPEC CPU 2006","year":"2006"},{"key":"e_1_3_2_1_2_1","unstructured":"2010. SQLite. https:\/\/www.sqlite.org .  2010. SQLite. https:\/\/www.sqlite.org ."},{"key":"e_1_3_2_1_3_1","unstructured":"2016. IDA Pro disassembler. https:\/\/www.hex-rays.com\/products\/ida\/ .  2016. IDA Pro disassembler. https:\/\/www.hex-rays.com\/products\/ida\/ ."},{"key":"e_1_3_2_1_4_1","volume-title":"Byteweight: Learning to recognize functions in binary code. USENIX.","author":"Bao Tiffany","year":"2014"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/850947.853341"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/358438.349342"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896499"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3141235.3141243"},{"key":"e_1_3_2_1_9_1","unstructured":"Gary Cokins. 2004. Performance management: finding the missing pieces (to close the intelligence gap). Vol. 2. John Wiley & Sons.  Gary Cokins. 2004. Performance management: finding the missing pieces (to close the intelligence gap). Vol. 2. John Wiley & Sons."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134285.1134309"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033019.3033028"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88625-9_16"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517312.2517315"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2017.22"},{"key":"e_1_3_2_1_15_1","unstructured":"Xiangkun Jia Chao Zhang Purui Su Yi Yang Huafeng Huang and Dengguo Feng. 2017. Towards Efficient Heap Overflow Discovery. (2017).  Xiangkun Jia Chao Zhang Purui Su Yi Yang Huafeng Huang and Dengguo Feng. 2017. Towards Efficient Heap Overflow Discovery. (2017)."},{"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.1145\/1095430.1081737"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2596141"},{"key":"e_1_3_2_1_20_1","volume-title":"26th USENIX Security Symposium.","author":"Ming Jiang","year":"2017"},{"key":"e_1_3_2_1_21_1","unstructured":"Lili Mou Ge Li Yuxuan Liu Hao Peng Zhi Jin Yan Xu and Lu Zhang. 2014. Building program vector representations for deep learning. arXiv preprint arXiv:1409.3358 (2014).  Lili Mou Ge Li Yuxuan Liu Hao Peng Zhi Jin Yan Xu and Lu Zhang. 2014. Building program vector representations for deep learning. arXiv preprint arXiv:1409.3358 (2014)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543135.1542504"},{"key":"e_1_3_2_1_23_1","first-page":"2825","article-title":"Scikit-learn: Machine learning in Python","author":"Pedregosa Fabian","year":"2011","journal-title":"Journal of Machine Learning Research 12"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.49"},{"key":"e_1_3_2_1_25_1","unstructured":"David A Powner. 2016. Federal agencies need to address aging legacy systems. Testimony before the Committee on Oversight and Government Reform House of Representatives (2016).  David A Powner. 2016. Federal agencies need to address aging legacy systems. Testimony before the Committee on Oversight and Government Reform House of Representatives (2016)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Aravind Prakash Xunchao Hu and Heng Yin. 2015. vfGuard: Strict Protection for Virtual Function Calls in COTS C++ Binaries.. In NDSS.  Aravind Prakash Xunchao Hu and Heng Yin. 2015. vfGuard: Strict Protection for Virtual Function Calls in COTS C++ Binaries.. In NDSS.","DOI":"10.14722\/ndss.2015.23297"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2009.02.007"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1181309.1181317"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.17"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89862-7_1"},{"key":"e_1_3_2_1_31_1","volume-title":"Dyninst: An application program interface (api) for runtime code generation. Online","author":"Source Open","year":"2016"},{"key":"e_1_3_2_1_32_1","unstructured":"Andrew Suffield. 2003. Bounds Checking for C and C++. BEng dissertation Imperial College London (2003).  Andrew Suffield. 2003. Bounds Checking for C and C++. BEng dissertation Imperial College London (2003)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543753.1543754"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2007.346205"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2004.5"},{"key":"e_1_3_2_1_36_1","unstructured":"Zack Whittaker. 2017. Microsoft fixes \u2019critical\u2019 security bugs affecting all versions of Windows. http:\/\/www.zdnet.com\/article\/ critical-security-bugs-affect-all-windows-versions .  Zack Whittaker. 2017. Microsoft fixes \u2019critical\u2019 security bugs affecting all versions of Windows. http:\/\/www.zdnet.com\/article\/ critical-security-bugs-affect-all-windows-versions ."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-58469-0_28"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2420950.2421003"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516665"},{"key":"e_1_3_2_1_40_1","volume-title":"IEEE 31st International Conference on. IEEE, 467\u2013470","author":"Yao Fan","year":"2013"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2017.57"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2014.20"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Mingwei Zhang Michalis Polychronakis and R Sekar. 2017. Protecting COTS Binaries from Disclosure-guided Code Reuse Attacks. (2017).  Mingwei Zhang Michalis Polychronakis and R Sekar. 2017. Protecting COTS Binaries from Disclosure-guided Code Reuse Attacks. (2017).","DOI":"10.1145\/3134600.3134634"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143983"}],"event":{"name":"PLDI '18: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Philadelphia PA USA","acronym":"PLDI '18","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2nd ACM SIGPLAN International Workshop on Machine Learning and Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3211346.3211347","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3211346.3211347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:14Z","timestamp":1750208894000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3211346.3211347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,18]]},"references-count":44,"alternative-id":["10.1145\/3211346.3211347","10.1145\/3211346"],"URL":"https:\/\/doi.org\/10.1145\/3211346.3211347","relation":{},"subject":[],"published":{"date-parts":[[2018,6,18]]},"assertion":[{"value":"2018-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}