{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T04:31:32Z","timestamp":1769747492691,"version":"3.49.0"},"reference-count":77,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Bridge Gap Fund of TTC\/HKUST","award":["BGF.003.2021"],"award-info":[{"award-number":["BGF.003.2021"]}]},{"name":"CCF-Tencent Open Research Fund"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2023,1,1]]},"DOI":"10.1109\/tse.2022.3149240","type":"journal-article","created":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T20:40:17Z","timestamp":1644352817000},"page":"226-250","source":"Crossref","is-referenced-by-count":13,"title":["Enhancing DNN-Based Binary Code Function Search With Low-Cost Equivalence Checking"],"prefix":"10.1109","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1066-0331","authenticated-orcid":false,"given":"Huaijin","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, HKUST, Kowloon, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pingchuan","family":"Ma","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, HKUST, Kowloon, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3053-8923","authenticated-orcid":false,"given":"Yuanyuan","family":"Yuan","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, HKUST, Kowloon, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7872-1129","authenticated-orcid":false,"given":"Zhibo","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, HKUST, Kowloon, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0866-0308","authenticated-orcid":false,"given":"Shuai","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, HKUST, Kowloon, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiyi","family":"Tang","sequence":"additional","affiliation":[{"name":"Tencent Security Keen Lab, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sen","family":"Nie","sequence":"additional","affiliation":[{"name":"Tencent Security Keen Lab, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi","family":"Wu","sequence":"additional","affiliation":[{"name":"Tencent Security Keen Lab, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"81","article-title":"Towards automatic software lineage inference","volume-title":"Proc. 22nd USENIX Conf. Secur.","author":"Jang"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2089125.2089126"},{"key":"ref3","first-page":"887","article-title":"Precise and accurate patch presence test for binaries","volume-title":"Proc. 27th USENIX Secur. Symp.","author":"Zhang"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635900"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336767"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3290353"},{"key":"ref7","article-title":"code2seq: Generating sequences from structured representations of code","author":"Alon","year":"2018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2019.23492"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2016.23185"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3238147.3240480"},{"key":"ref11","article-title":"Aroma: Code recommendation via structural code search","author":"Luan","year":"2018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134018"},{"key":"ref13","first-page":"3589","article-title":"Neural code comprehension: A learnable representation of code semantics","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","author":"Ben-Nun"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5466"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2020.24311"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3238147.3238199"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484587"},{"key":"ref19","first-page":"49","article-title":"Under-constrained symbolic execution: Correctness checking for real code","volume-title":"Proc. 24th USENIX Conf. Secur. Symp.","author":"Ramos"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88625-9_16"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.49"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3446371"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2012.70"},{"key":"ref25","first-page":"253","article-title":"BinSim: Trace-based semantic binary diffing via system call sliced segment equivalence checking","volume-title":"Proc. 26th USENIX Secur. Symp.","author":"Ming"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908126"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950350"},{"key":"ref28","first-page":"745","article-title":"QSYM: A practical concolic execution engine tailored for hybrid fuzzing","volume-title":"Proc. 27th USENIX Conf. Secur. Symp.","author":"Yun"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2017.8115645"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572283"},{"key":"ref31","first-page":"303","article-title":"Blanket execution: Dynamic similarity testing for program binaries and components","volume-title":"Proc. 23rd USENIX Secur. Symp.","author":"Egele"},{"key":"ref32","article-title":"Software ethology: An accurate and resilient, and cross-architecture binary analysis framework","author":"McKee","year":"2019"},{"key":"ref33","first-page":"209","article-title":"KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs","volume-title":"Proc. 8th USENIX Conf. Oper. Syst. Des. Implementation","author":"Cadar"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3395363.3397360"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60973-3_77"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4302-0909-6_37","article-title":"Defensive programming","volume-title":"A Programmers Introduction to C#","author":"Gunnerson","year":"2001"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-3459-4_11"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.17"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.25"},{"key":"ref43","first-page":"845","article-title":"ByteWeight: Learning to recognize functions in binary code","volume-title":"Proc. 23rd USENIX Secur. Symp.","author":"Bao"},{"key":"ref45","first-page":"611","article-title":"Recognizing functions in binaries with neural networks","volume-title":"Proc. 24th USENIX Conf. Secur. Symp.","author":"Shin"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00006"},{"key":"ref47","first-page":"627","article-title":"Reassembleable disassembling","volume-title":"Proc. 24th USENIX Secur. Symp.","author":"Wang"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2017.23225"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2018.23300"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.17"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/SPRO.2015.10"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233837"},{"key":"ref54","article-title":"BERT: pre-training of deep bidirectional transformers for language understanding","author":"Devlin","year":"2018"},{"key":"ref55","article-title":"Gated graph sequence neural networks","author":"Li","year":"2015"},{"key":"ref56","article-title":"word2vec explained: Deriving mikolov et al.\u2019s negative-sampling word-embedding method","author":"Goldberg","year":"2014"},{"key":"ref57","article-title":"Neural message passing for quantum chemistry","author":"Gilmer","year":"2017"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.5555\/3044805.3045025"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1017\/S1351324919000202"},{"key":"ref64","first-page":"303","article-title":"Blanket execution: Dynamic similarity testing for program binaries and components","volume-title":"Proc. 23rd USENIX Secur. Symp.","author":"Egele"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/3510003.3510217"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2019.2918326"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58951-6_15"},{"key":"ref71","first-page":"161","article-title":"Structural comparison of executable objects","volume-title":"Proc. Int. GI Workshop Detection Intrusions Malware Vulnerability Assessment","author":"Flake"},{"issue":"2","key":"ref73","article-title":"Explainable artificial intelligence (XAI)","volume":"2","author":"Gunning","year":"2017","journal-title":"Defense Adv. Res. Projects Agency, nd Web"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01234-2_1"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/3182657"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/CNS48642.2020.9162164"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.14722\/bar.2019.23057"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594343"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062387"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653736"},{"key":"ref81","first-page":"1","article-title":"Graph-based comparison of executable objects (English version)","volume-title":"Proc. Symp. Secur. Technol. Inf. Commun.","author":"Dullien"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572287"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30144-8_34"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321672"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2009.24"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985899"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2909-7"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2015.2418777"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2016.50"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2018.2827379"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/32\/10008953\/09707874.pdf?arnumber=9707874","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T23:50:31Z","timestamp":1705535431000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9707874\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,1]]},"references-count":77,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tse.2022.3149240","relation":{},"ISSN":["0098-5589","1939-3520","2326-3881"],"issn-type":[{"value":"0098-5589","type":"print"},{"value":"1939-3520","type":"electronic"},{"value":"2326-3881","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,1]]}}}