{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T04:17:52Z","timestamp":1782879472394,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,1,9]],"date-time":"2006-01-09T00:00:00Z","timestamp":1136764800000},"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":[[2006,1,9]]},"DOI":"10.1145\/1111542.1111560","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"100-111","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Intermediate-representation recovery from low-level code"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Reps","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gogul","family":"Balakrishnan","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junghee","family":"Lim","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"PREfast with driver-specific rules October 2004. WHDC Microsoft Corp. http:\/\/www.microsoft.com\/whdc\/devtools\/tools\/PREfastdrv.mspx.]]  PREfast with driver-specific rules October 2004. WHDC Microsoft Corp. http:\/\/www.microsoft.com\/whdc\/devtools\/tools\/PREfastdrv.mspx.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007588710878"},{"key":"e_1_3_2_1_4_1","volume-title":"CC","author":"Balakrishnan G.","year":"2004","unstructured":"G. Balakrishnan and T. Reps . Analyzing memory accesses in x86 executables . In CC , 2004 .]] G. Balakrishnan and T. Reps. Analyzing memory accesses in x86 executables. In CC, 2004.]]"},{"key":"e_1_3_2_1_5_1","volume-title":"UW-Madison","author":"Balakrishnan G.","year":"2005","unstructured":"G. Balakrishnan and T. Reps . Recency-abstraction for heap-allocated storage. TR 1548 , UW-Madison , December 2005 .]] G. Balakrishnan and T. Reps. Recency-abstraction for heap-allocated storage. TR 1548, UW-Madison, December 2005.]]"},{"key":"e_1_3_2_1_6_1","volume-title":"UW-Madison","author":"Balakrishnan G.","year":"2005","unstructured":"G. Balakrishnan and T. Reps . Recovery of variables and heap structure in x86 executables. TR 1533 , UW-Madison , 2005 .]] G. Balakrishnan and T. Reps. Recovery of variables and heap structure in x86 executables. TR 1533, UW-Madison, 2005.]]"},{"key":"e_1_3_2_1_7_1","volume-title":"VSTTE","author":"Balakrishnan G.","year":"2005","unstructured":"G. Balakrishnan , T. Reps , D. Melski , and T. Teitelbaum . WYSINWYX: What You See Is Not What You eXecute . In VSTTE , 2005 .]] G. Balakrishnan, T. Reps, D. Melski, and T. Teitelbaum. WYSINWYX: What You See Is Not What You eXecute. In VSTTE, 2005.]]"},{"key":"e_1_3_2_1_8_1","volume-title":"CAV.","author":"Ball T.","year":"2001","unstructured":"T. Ball and S. K. Rajamani . The SLAM toolkit . In CAV. , 2001 .]] T. Ball and S. K. Rajamani. The SLAM toolkit. In CAV., 2001.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"Int. J. of Req. Eng.","author":"Bergeron J.","year":"2001","unstructured":"J. Bergeron , M. Debbabi , J. Desharnais , M. M. Erhioui , Y. Lavoie , and N. Tawbi . Static detection of malicious code in executable programs . Int. J. of Req. Eng. , 2001 .]] J. Bergeron, M. Debbabi, J. Desharnais, M. M. Erhioui, Y. Lavoie, and N. Tawbi. Static detection of malicious code in executable programs. Int. J. of Req. Eng., 2001.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/647067.757010"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604137"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(200006)30:7%3C775::AID-SPE309%3E3.0.CO;2-H"},{"key":"e_1_3_2_1_13_1","volume-title":"NDSS","author":"Chen H.","year":"2004","unstructured":"H. Chen , D. Dean , and D. Wagner . Model checking one million lines of C code . In NDSS , 2004 .]] H. Chen, D. Dean, and D. Wagner. Model checking one million lines of C code. In NDSS, 2004.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586142"},{"key":"e_1_3_2_1_15_1","volume-title":"Queensland","author":"Cifuentes C.","year":"1997","unstructured":"C. Cifuentes and A. Fraboulet . Interprocedural data flow recovery of high-level language code from assembly. TR 421, U . Queensland , 1997 .]] C. Cifuentes and A. Fraboulet. Interprocedural data flow recovery of high-level language code from assembly. TR 421, U. Queensland, 1997.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645545.656038"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/850947.853321"},{"key":"e_1_3_2_1_18_1","unstructured":"CodeSurfer GrammaTech Inc. \"http:\/\/www.grammatech.com\".]]  CodeSurfer GrammaTech Inc. \"http:\/\/www.grammatech.com\".]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.53996"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/337180.337234"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512538"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268948"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292543"},{"key":"e_1_3_2_1_25_1","volume-title":"OSDI.","author":"Engler D. R.","year":"2000","unstructured":"D. R. Engler , B. Chelf , A. Chou , and S. Hallem . Checking system rules using system-specific, programmer-written compiler extensions . In OSDI. 2000 .]] D. R. Engler, B. Chelf, A. Chou, and S. Hallem. Checking system rules using system-specific, programmer-written compiler extensions. In OSDI. 2000.]]"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2005.27"},{"key":"e_1_3_2_1_27_1","volume-title":"Model checking Java programs using Java PathFinder. STTT, 2(4)","author":"Havelund K.","year":"2000","unstructured":"K. Havelund and T. Pressburger . Model checking Java programs using Java PathFinder. STTT, 2(4) , 2000 .]] K. Havelund and T. Pressburger. Model checking Java programs using Java PathFinder. STTT, 2(4), 2000.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/503272.503279"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/77606.77608"},{"key":"e_1_3_2_1_30_1","volume-title":"Some bad news and some good news","author":"Howard M.","year":"2002","unstructured":"M. Howard . Some bad news and some good news . October 2002 . MSDN , Microsoft Corp .]] M. Howard. Some bad news and some good news. October 2002. MSDN, Microsoft Corp.]]"},{"key":"e_1_3_2_1_31_1","unstructured":"IDAPro disassembler http:\/\/www.datarescue.com\/idabase\/.]]  IDAPro disassembler http:\/\/www.datarescue.com\/idabase\/.]]"},{"key":"e_1_3_2_1_32_1","volume-title":"WPDS++","author":"Kidd N.","year":"2004","unstructured":"N. Kidd , T. Reps , D. Melski , and A. Lal . WPDS++ ; A C ++ library for weighted pushdown systems, 2004 . http:\/\/www.cs.wisc.edu\/wpis\/wpds++\/.]] N. Kidd, T. Reps, D. Melski, and A. Lal. WPDS++; A C++ library for weighted pushdown systems, 2004. http:\/\/www.cs.wisc.edu\/wpis\/wpds++\/.]]"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_44"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207163"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31987-0_5"},{"key":"e_1_3_2_1_36_1","volume-title":"ESOP","author":"Mycroft A.","year":"1999","unstructured":"A. Mycroft . Type-based decompilation . In ESOP , 1999 .]] A. Mycroft. Type-based decompilation. In ESOP, 1999.]]"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292553"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575467_15"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44898-5_11"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.009"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/646542.696206"},{"key":"e_1_3_2_1_42_1","volume-title":"Program Flow Analysis: Theory and Applications","author":"Sharir M.","year":"1981","unstructured":"M. Sharir and A. Pnueli . Two approaches to interprocedural data flow analysis . In Program Flow Analysis: Theory and Applications , chapter 7. Prentice-Hall , Englewood Cliffs, NJ , 1981 .]] M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, chapter 7. Prentice-Hall, Englewood Cliffs, NJ, 1981.]]"},{"key":"e_1_3_2_1_43_1","volume-title":"TR 2001--50","author":"Srivastava A.","year":"2001","unstructured":"A. Srivastava , A. Edwards , and H. Vo . Vulcan: Binary transformation in a distributed environment . TR 2001--50 , Microsoft Research , 2001 .]] A. Srivastava, A. Edwards, and H. Vo. Vulcan: Binary transformation in a distributed environment. TR 2001--50, Microsoft Research, 2001.]]"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178260"},{"key":"e_1_3_2_1_45_1","volume-title":"NDSS","author":"Wagner D.","year":"2000","unstructured":"D. Wagner , J. Foster , E. Brewer , and A. Aiken . A first step towards automated detection of buffer overrun vulnerabilities . In NDSS , 2000 .]] D. Wagner, J. Foster, E. Brewer, and A. Aiken. A first step towards automated detection of buffer overrun vulnerabilities. In NDSS, 2000.]]"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3501-2_15"},{"key":"e_1_3_2_1_47_1","unstructured":"H. S. Warren Jr. Hacker's Delight. Addison-Wesley 2003.]]   H. S. Warren Jr. Hacker's Delight. Addison-Wesley 2003.]]"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207111"}],"event":{"name":"PEPM06: Partial Evaluation and Program Manipulation 2006","location":"Charleston South Carolina","acronym":"PEPM06","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111542.1111560","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1111542.1111560","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:24Z","timestamp":1750262904000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111542.1111560"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,9]]},"references-count":47,"alternative-id":["10.1145\/1111542.1111560","10.1145\/1111542"],"URL":"https:\/\/doi.org\/10.1145\/1111542.1111560","relation":{},"subject":[],"published":{"date-parts":[[2006,1,9]]},"assertion":[{"value":"2006-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}