{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:28:53Z","timestamp":1775179733973,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61173021"],"award-info":[{"award-number":["61173021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2016,2,1]]},"DOI":"10.1109\/tse.2015.2470241","type":"journal-article","created":{"date-parts":[[2015,8,19]],"date-time":"2015-08-19T14:51:41Z","timestamp":1439995901000},"page":"187-202","source":"Crossref","is-referenced-by-count":21,"title":["Using Reduced Execution Flow Graph to Identify Library Functions in Binary Code"],"prefix":"10.1109","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3264-1681","authenticated-orcid":false,"given":"Jing","family":"Qiu","sequence":"first","affiliation":[]},{"given":"Xiaohong","family":"Su","sequence":"additional","affiliation":[]},{"given":"Peijun","family":"Ma","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/567532.567555"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2001.957835"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/77606.77608"},{"key":"ref14","year":"2014"},{"key":"ref15","article-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"johnson","year":"1979"},{"key":"ref16","author":"knizhnik","year":"2014"},{"key":"ref17","author":"blankstein","year":"2009"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICIAP.1999.797762"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-010-0405-3"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594343"},{"key":"ref4","first-page":"101","article-title":"Automatic generation of string signatures for malware detection","author":"griffin","year":"0","journal-title":"Recent Adv in Intrusion Detection"},{"key":"ref27","first-page":"207","article-title":"Polymorphic worm detection using structural information of executables","author":"kruegel","year":"0","journal-title":"Recent Adv in Intrusion Detection"},{"key":"ref3","article-title":"Fast library identification and recognition technology","author":"guilfanov","year":"0"},{"key":"ref6","first-page":"261","article-title":"Library functions identification in binary code by using graph isomorphism testings","author":"qiu","year":"0","journal-title":"Proc IEEE 22nd Int Conf Softw Anal Evol Reeng"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.diin.2015.01.011"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2024569.2024571"},{"key":"ref8","volume":"1009","author":"aho","year":"2007","journal-title":"Compilers Principles Techniques and Tools"},{"key":"ref7","article-title":"Master\/slave speculative parallelization and approximate code","author":"zilles","year":"0"},{"key":"ref2","article-title":"Signatures for library functions in executable files","author":"emmerik","year":"1994"},{"key":"ref1","year":"2014"},{"key":"ref9","first-page":"1978","author":"kuck","year":"0","journal-title":"Structure of Computers and Computations"},{"key":"ref20","year":"2014"},{"key":"ref22","year":"2014"},{"key":"ref21","year":"2014"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150522"},{"key":"ref23","first-page":"40","article-title":"Using slicing to identify duplication in source code","author":"komondoor","year":"0","journal-title":"Static Analysis Proceedings"},{"key":"ref26","first-page":"129","article-title":"Detecting self-mutating malware using control-flow graph matching","author":"bruschi","year":"0","journal-title":"Detection of Intrusions and Malware and Vulnerability Assessment"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572287"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/32\/7404330\/7210204.pdf?arnumber=7210204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:48:03Z","timestamp":1641988083000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7210204\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,1]]},"references-count":29,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tse.2015.2470241","relation":{},"ISSN":["0098-5589","1939-3520"],"issn-type":[{"value":"0098-5589","type":"print"},{"value":"1939-3520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,1]]}}}