{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:00Z","timestamp":1750306500914,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T00:00:00Z","timestamp":1449532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,12,8]]},"DOI":"10.1145\/2843859.2843861","type":"proceedings-article","created":{"date-parts":[[2015,12,30]],"date-time":"2015-12-30T13:13:44Z","timestamp":1451481224000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Lightweight heuristics to retrieve parameter associations from binaries"],"prefix":"10.1145","author":[{"given":"Franck","family":"de Go\u00ebr","sequence":"first","affiliation":[{"name":"LIG, UGA, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Groz","sequence":"additional","affiliation":[{"name":"LIG, UGA, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Mounier","sequence":"additional","affiliation":[{"name":"Verimag, UGA, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,12,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763048.1763050"},{"key":"e_1_3_2_1_2_1","volume-title":"USENIX Security","author":"Bao T.","year":"2014","unstructured":"T. Bao , J. Burket , M. Woo , R. Turner , and D. Brumley . Byteweight: Learning to recognize functions in binary code . USENIX Security , 2014 . T. Bao, J. Burket, M. Woo, R. Turner, and D. Brumley. Byteweight: Learning to recognize functions in binary code. USENIX Security, 2014."},{"key":"e_1_3_2_1_3_1","volume-title":"DTIC Document","author":"Caballero J.","year":"2009","unstructured":"J. Caballero , N. M. Johnson , S. McCamant , and D. Song . Binary code extraction and interface identification for security applications. Technical report , DTIC Document , 2009 . J. Caballero, N. M. Johnson, S. McCamant, and D. Song. Binary code extraction and interface identification for security applications. Technical report, DTIC Document, 2009."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2013.6671277"},{"key":"e_1_3_2_1_5_1","unstructured":"F. de Go\u00ebr. Implementation of our approach is available on github. https:\/\/github.com\/Frky\/scat.  F. de Go\u00ebr. Implementation of our approach is available on github. https:\/\/github.com\/Frky\/scat."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462165"},{"key":"e_1_3_2_1_7_1","first-page":"1","volume-title":"Computer Virology and Hacking Techniques","author":"Feist J.","year":"2013","unstructured":"J. Feist , L. Mounier , and M.-L. Potet . Statically detecting use after free on binary code. J . Computer Virology and Hacking Techniques , pages 1 -- 7 , 2013 . J. Feist, L. Mounier, and M.-L. Potet. Statically detecting use after free on binary code. J. Computer Virology and Hacking Techniques, pages 1--7, 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556464.2556465"},{"key":"e_1_3_2_1_9_1","volume-title":"NDSS","author":"Lee J.","year":"2011","unstructured":"J. Lee , T. Avgerinos , and D. Brumley . TIE: principled reverse engineering of types in binary programs . In NDSS , San Diego , California, USA , 2011 . J. Lee, T. Avgerinos, and D. Brumley. TIE: principled reverse engineering of types in binary programs. In NDSS, San Diego, California, USA, 2011."},{"key":"e_1_3_2_1_10_1","volume-title":"NDSS","author":"Lin Z.","year":"2010","unstructured":"Z. Lin , X. Zhang , and D. Xu . Automatic reverse engineering of data structures from binary execution . In NDSS , 2010 . Z. Lin, X. Zhang, and D. Xu. Automatic reverse engineering of data structures from binary execution. In NDSS, 2010."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064978.1065034"},{"key":"e_1_3_2_1_12_1","volume-title":"System v application binary interface. amd architecture processor supplement. Also available as http:\/\/x86-64.org\/documentation\/abi.pdf","author":"Matz M.","year":"2013","unstructured":"M. Matz , J. Hubicka , A. Jaeger , and M. Mitchell . System v application binary interface. amd architecture processor supplement. Also available as http:\/\/x86-64.org\/documentation\/abi.pdf , 2013 . M. Matz, J. Hubicka, A. Jaeger, and M. Mitchell. System v application binary interface. amd architecture processor supplement. Also available as http:\/\/x86-64.org\/documentation\/abi.pdf, 2013."},{"key":"e_1_3_2_1_13_1","unstructured":"MITRE. Cwe-416: Use after free. https:\/\/cwe.mitre.org\/data\/definitions\/416.html.  MITRE. Cwe-416: Use after free. https:\/\/cwe.mitre.org\/data\/definitions\/416.html."},{"key":"e_1_3_2_1_14_1","volume-title":"NDSS","author":"Newsome J.","year":"2005","unstructured":"J. Newsome and D. Song . Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software . In NDSS , 2005 . J. Newsome and D. Song. Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software. In NDSS, 2005."},{"key":"e_1_3_2_1_15_1","first-page":"16","volume-title":"ETAPS, CC'08\/ETAPS'08","author":"Reps T.","year":"2008","unstructured":"T. Reps and G. Balakrishnan . Improved memory-access analysis for x86 executables . In ETAPS, CC'08\/ETAPS'08 , pages 16 -- 35 , Berlin, Heidelberg , 2008 . Springer-Verlag . T. Reps and G. Balakrishnan. Improved memory-access analysis for x86 executables. In ETAPS, CC'08\/ETAPS'08, pages 16--35, Berlin, Heidelberg, 2008. Springer-Verlag."},{"key":"e_1_3_2_1_16_1","first-page":"798","volume-title":"AAAI","author":"Rosenblum N. E.","year":"2008","unstructured":"N. E. Rosenblum , X. Zhu , B. P. Miller , and K. Hunt . Learning to analyze binary computer code . In AAAI , pages 798 -- 804 , 2008 . N. E. Rosenblum, X. Zhu, B. P. Miller, and K. Hunt. Learning to analyze binary computer code. In AAAI, pages 798--804, 2008."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.26"},{"key":"e_1_3_2_1_18_1","volume-title":"NDSS. Citeseer","author":"Slowinska A.","year":"2011","unstructured":"A. Slowinska , T. Stancescu , and H. Bos . Howard: A dynamic excavator for reverse engineering data structures . In NDSS. Citeseer , 2011 . A. Slowinska, T. Stancescu, and H. Bos. Howard: A dynamic excavator for reverse engineering data structures. In NDSS. Citeseer, 2011."}],"event":{"name":"PPREW-5: Program Protection and Reverse Engineering Workshop","acronym":"PPREW-5","location":"Los Angeles CA USA"},"container-title":["Proceedings of the 5th Program Protection and Reverse Engineering Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2843859.2843861","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2843859.2843861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:50Z","timestamp":1750225730000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2843859.2843861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,8]]},"references-count":18,"alternative-id":["10.1145\/2843859.2843861","10.1145\/2843859"],"URL":"https:\/\/doi.org\/10.1145\/2843859.2843861","relation":{},"subject":[],"published":{"date-parts":[[2015,12,8]]},"assertion":[{"value":"2015-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}