{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:12:10Z","timestamp":1772039530961,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540886242","type":"print"},{"value":"9783540886259","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88625-9_16","type":"book-chapter","created":{"date-parts":[[2008,10,15]],"date-time":"2008-10-15T00:03:06Z","timestamp":1224028986000},"page":"238-255","source":"Crossref","is-referenced-by-count":173,"title":["BinHunt: Automatically Finding Semantic Differences in Binary Programs"],"prefix":"10.1007","author":[{"given":"Debin","family":"Gao","sequence":"first","affiliation":[]},{"given":"Michael K.","family":"Reiter","sequence":"additional","affiliation":[]},{"given":"Dawn","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Balakrishnan, G., Gruian, R., Reps, T., Teitelbaum, T.: Codesurfer\/x86 - a platform for analyzing x86 executables. In: Proceedings of the Conference on Compiler Construction (2005)","DOI":"10.1007\/978-3-540-31985-6_19"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Brumley, D., Poosankam, P., Song, D., Zheng, J.: Automatic patch-based exploit generation is possible: techniques and implications. In: Proceedings of the 2008 IEEE Symposium on Security and Privacy (May 2008) (to appear)","DOI":"10.1109\/SP.2008.17"},{"key":"16_CR3","unstructured":"Dullien, T., Rolles, R.: Graph-based comparison of executable objects. In: Proceedings of SSTIC 2005 (2005)"},{"key":"16_CR4","unstructured":"Flake, H.: Structural comparison of executable objects. In: Proceedings of the GI International Conference on Detection of Intrusions & Malware, and Vulnerability Assessment 2004 (2004)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_52","volume-title":"Computer Aided Verification","author":"V. Ganesh","year":"2007","unstructured":"Ganesh, V., Dill, D.: A decision procedure for bit-vectors and arrays. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590. Springer, Heidelberg (2007)"},{"key":"16_CR6","unstructured":"DataRescue Inc. IDA Pro, \n                    \n                      http:\/\/www.datarescue.com\/idabase\/"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"King, J.: Symbolic execution and program testing. Communications of the ACM\u00a019(7) (1976)","DOI":"10.1145\/360248.360252"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Krissinel, E., Henrick, K.: Common subgraph isomorphism detection by backtracking search. Software \u2014 Practice and Experience\u00a034 (2004)","DOI":"10.1002\/spe.588"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Levi, G.: A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo\u00a09 (1972)","DOI":"10.1007\/BF02575586"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Linn, C., Debray, S.: Obfuscation of executable code to improve resistance to static disassembly. In: Proceedings of the 11th ACM Conference on Computer & Communication Security (CCS 2003) (2003)","DOI":"10.1145\/948109.948149"},{"key":"16_CR11","unstructured":"Raymond, J., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computer-Aided Molecular Design\u00a016 (2002)"},{"key":"16_CR12","unstructured":"Sankoff, D., Kruskal, J.B.: Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison. Addison-Wesley Pu. Co., Reading (1983)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Ullman, J.: An algorithm for subgraph isomorphism. Journal of the Association of Computers and Machines\u00a023 (1976)","DOI":"10.1145\/321921.321925"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Vintsyuk, T.K.: Speech discrimination by dynamic programming. Cybernetics and Systems Analysis\u00a04(1) (1968)","DOI":"10.1007\/BF01074755"},{"key":"16_CR15","unstructured":"Wang, Z., Pierce, K., McFarling, S.: Bmat - a binary matching tool for stale profile propagation. J. Instruction-Level Parallelism\u00a02 (2000)"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88625-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T20:06:21Z","timestamp":1566763581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88625-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886242","9783540886259"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88625-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}