{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:29Z","timestamp":1772164049413,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"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":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837633","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"191-203","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["From MinX to MinC: semantics-driven decompilation of recursive datatypes"],"prefix":"10.1145","author":[{"given":"Ed","family":"Robbins","sequence":"first","affiliation":[{"name":"University of Kent, UK"}]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[{"name":"University of Kent, UK"}]},{"given":"Tom","family":"Schrijvers","sequence":"additional","affiliation":[{"name":"KU Leuven, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"23","volume-title":"LNCS","author":"Balakrishnan G.","unstructured":"G. Balakrishnan and T. Reps . Analyzing Memory Accesses in x86 Executables. In CC , LNCS , pages 5\u2013 23 . Springer, 2004. G. Balakrishnan and T. Reps. Analyzing Memory Accesses in x86 Executables. In CC, LNCS, pages 5\u201323. Springer, 2004."},{"key":"e_1_3_2_1_2_1","first-page":"28","volume-title":"LNCS","author":"Balakrishnan G.","unstructured":"G. Balakrishnan and T. Reps . Divine: Discovering Variables in Executables. In VMCAI , LNCS , pages 1\u2013 28 . Springer, 2007. G. Balakrishnan and T. Reps. Divine: Discovering Variables in Executables. In VMCAI, LNCS, pages 1\u201328. Springer, 2007."},{"key":"e_1_3_2_1_3_1","series-title":"LNCS","first-page":"143","volume-title":"ITP","author":"Blazy S.","year":"2014","unstructured":"S. Blazy , V. Laporte , and D. Pichardie . Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code . In ITP , volume 8558 of LNCS , pages 128\u2013 143 , 2014 . S. Blazy, V. Laporte, and D. Pichardie. Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code. In ITP, volume 8558 of LNCS, pages 128\u2013143, 2014."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SADFE.2011.5"},{"key":"e_1_3_2_1_5_1","first-page":"244","volume-title":"Digging For Data Structures. In USENIX Symposium on Operating Systems Design and Implementation","author":"Cozzie A.","unstructured":"A. Cozzie , F. Stratton , H. Xue , and S. T. King . Digging For Data Structures. In USENIX Symposium on Operating Systems Design and Implementation , pages 231\u2013 244 . USENIX, 2008. A. Cozzie, F. Stratton, H. Xue, and S. T. King. Digging For Data Structures. In USENIX Symposium on Operating Systems Design and Implementation, pages 231\u2013244. USENIX, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1134\/S0361768809020066"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462165"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511609886","volume-title":"Constraint Handling Rules. CUP","author":"Fr\u00fchwirth T.","year":"2009","unstructured":"T. Fr\u00fchwirth . Constraint Handling Rules. CUP , 2009 . T. Fr\u00fchwirth. Constraint Handling Rules. CUP, 2009."},{"key":"e_1_3_2_1_9_1","volume-title":"WCRE","author":"Guilfanov I.","year":"2001","unstructured":"I. Guilfanov . A Simple Type System for Program Reengineering . In WCRE , pages 357\u2013. IEEE Computer Society , 2001 . I. Guilfanov. A Simple Type System for Program Reengineering. In WCRE, pages 357\u2013. IEEE Computer Society, 2001."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037057"},{"key":"e_1_3_2_1_11_1","unstructured":"H. S. Warren  Jr. Hacker\u2019s Delight. Addison-Wesley 2002.  H. S. Warren Jr. Hacker\u2019s Delight. Addison-Wesley 2002."},{"key":"e_1_3_2_1_12_1","series-title":"LNCS","first-page":"366","volume-title":"ESOP","author":"Katsumata S.","unstructured":"S. Katsumata and A. Ohori . Proof-Directed De-compilation of Low-Level Code . In ESOP , volume 2028 of LNCS , pages 352\u2013 366 . Springer, 2001. S. Katsumata and A. Ohori. Proof-Directed De-compilation of Low-Level Code. In ESOP, volume 2028 of LNCS, pages 352\u2013366. Springer, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-93900-9_19"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/359131.359136"},{"key":"e_1_3_2_1_15_1","volume-title":"TIE: Principled Reverse Engineering of Types in Binary Programs","author":"Lee J.","year":"2011","unstructured":"J. Lee , T. Avgerinos , and D. Brumley . TIE: Principled Reverse Engineering of Types in Binary Programs . In NDSS. The Internet Society , 2011 . J. Lee, T. Avgerinos, and D. Brumley. TIE: Principled Reverse Engineering of Types in Binary Programs. In NDSS. The Internet Society, 2011."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111037.1111042"},{"key":"e_1_3_2_1_17_1","first-page":"631","volume-title":"Hard and Soft Constraints. In Handbook of Satisfiability","author":"Li C. M.","unstructured":"C. M. Li and F. Many\u00e0 . MaxSAT , Hard and Soft Constraints. In Handbook of Satisfiability , pages 613\u2013 631 . IOS Press, 2009. C. M. Li and F. Many\u00e0. MaxSAT, Hard and Soft Constraints. In Handbook of Satisfiability, pages 613\u2013631. IOS Press, 2009."},{"key":"e_1_3_2_1_18_1","volume-title":"Automatic Reverse Engineering of Data Structures from Binary Execution","author":"Lin Z.","year":"2010","unstructured":"Z. Lin , X. Zhang , and D. Xu . Automatic Reverse Engineering of Data Structures from Binary Execution . In NDSS. The Internet Society , 2010 . Z. Lin, X. Zhang, and D. Xu. Automatic Reverse Engineering of Data Structures from Binary Execution. In NDSS. The Internet Society, 2010."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/319301.319345"},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","first-page":"223","volume-title":"ESOP","author":"Mycroft A.","unstructured":"A. Mycroft . Type-Based Decompilation (or Program Reconstruction via Type Reconstruction). In ESOP , volume 1576 of LNCS , pages 208\u2013 223 . Springer, 1999. A. Mycroft. Type-Based Decompilation (or Program Reconstruction via Type Reconstruction). In ESOP, volume 1576 of LNCS, pages 208\u2013223. Springer, 1999."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1517424.1517444"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660230"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2014.05.013"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505879.2505901"},{"key":"e_1_3_2_1_27_1","volume-title":"Fuzzing: Brute Force Vulnerability Discovery","author":"Sutton M.","year":"2007","unstructured":"M. Sutton , A. Greene , and P. Amini . Fuzzing: Brute Force Vulnerability Discovery . Addison-Wesley , 2007 . M. Sutton, A. Greene, and P. Amini. Fuzzing: Brute Force Vulnerability Discovery. Addison-Wesley, 2007."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2010.24"},{"key":"e_1_3_2_1_30_1","unstructured":"W. Wang. Ucc 2014. http:\/\/ucc.sourceforge.net\/.  W. Wang. Ucc 2014. http:\/\/ucc.sourceforge.net\/."},{"key":"e_1_3_2_1_31_1","volume-title":"Data Structures and Algorithm Analysis in C","author":"Weiss M. A.","year":"1996","unstructured":"M. A. Weiss . Data Structures and Algorithm Analysis in C . Addison-Wesley , 1996 . M. A. Weiss. Data Structures and Algorithm Analysis in C. Addison-Wesley, 1996."}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837633","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837633","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:37Z","timestamp":1750211017000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":29,"alternative-id":["10.1145\/2837614.2837633","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837633","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837633","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}