{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T03:16:35Z","timestamp":1725938195022},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319736969"},{"type":"electronic","value":"9783319736976"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73697-6_12","type":"book-chapter","created":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T21:53:43Z","timestamp":1515102823000},"page":"158-172","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approxis: A Fast, Robust, Lightweight and Approximate Disassembler Considered in the Field of Memory Forensics"],"prefix":"10.1007","author":[{"given":"Lorenz","family":"Liebler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harald","family":"Baier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,6]]},"reference":[{"key":"12_CR1","unstructured":"Andriesse, D., Chen, X., van der Veen, V., Slowinska, A., Bos, H.: An in-depth analysis of disassembly on full-scale x86\/x64 binaries. In: USENIX Security Symposium (2016)"},{"key":"12_CR2","unstructured":"Bilar, D.: Statistical structures: fingerprinting malware for classification and analysis. In: Proceedings of Black Hat Federal 2006 (2006)"},{"key":"12_CR3","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-39891-9_11","volume-title":"Digital Forensics and Cyber Crime","author":"F Breitinger","year":"2013","unstructured":"Breitinger, F., Baier, H.: Similarity preserving hashing: eligible properties and a new algorithm MRSH-v2. In: Rogers, M., Seigfried-Spellar, K.C. (eds.) ICDF2C 2012. LNICST, vol. 114, pp. 167\u2013182. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39891-9_11"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.diin.2007.06.008","volume":"4","author":"B Dolan-Gavitt","year":"2007","unstructured":"Dolan-Gavitt, B.: The VAD tree: a process-eye view of physical memory. Digit. Invest. 4, 62\u201364 (2007)","journal-title":"Digit. Invest."},{"key":"12_CR5","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-25512-5_4","volume-title":"Digital Forensics and Cyber Crime","author":"V Gupta","year":"2015","unstructured":"Gupta, V., Breitinger, F.: How cuckoo filter can improve existing approximate matching techniques. In: James, J.I., Breitinger, F. (eds.) ICDF2C 2015. LNICST, vol. 157, pp. 39\u201352. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-25512-5_4"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.diin.2007.06.011","volume":"4","author":"V Roussev","year":"2007","unstructured":"Roussev, V., Richard, G.G., Marziale, L.: Multi-resolution similarity hashing. Digit. Invest. 4, 105\u2013113 (2007)","journal-title":"Digit. Invest."},{"key":"12_CR7","unstructured":"Radhakrishnan, D.: Approximate disassembly. Master\u2019s Projects. 155 (2010). \nhttp:\/\/scholarworks.sjsu.edu\/etd_projects\/155\/"},{"key":"12_CR8","unstructured":"Walters, A., Matheny, B., White, D.: Using hashing to improve volatile memory forensic analysis. In: American Acadaemy of Forensic Sciences Annual Meeting (2008)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/978-3-642-23808-6_34","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"R Wartell","year":"2011","unstructured":"Wartell, R., Zhou, Y., Hamlen, K.W., Kantarcioglu, M., Thuraisingham, B.: Differentiating code from data in x86 binaries. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011. LNCS (LNAI), vol. 6913, pp. 522\u2013536. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-23808-6_34"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"S59","DOI":"10.1016\/j.diin.2013.06.007","volume":"10","author":"A White","year":"2013","unstructured":"White, A., Schatz, B., Foo, E.: Integrity verification of user space code. Digit. Invest. 10, S59\u2013S68 (2013)","journal-title":"Digit. Invest."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Digital Forensics and Cyber Crime"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73697-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T21:58:12Z","timestamp":1515103092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73697-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319736969","9783319736976"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73697-6_12","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2018]]}}}