{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:40:09Z","timestamp":1756384809518},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540610533"},{"type":"electronic","value":"9783540499398"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61053-7_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:13:29Z","timestamp":1330290809000},"page":"91-105","source":"Crossref","is-referenced-by-count":19,"title":["Structuring decompiled graphs"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Cifuentes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"7","key":"7_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/390013.808479","volume":"5","author":"F.E. Allen","year":"1970","unstructured":"F.E. Allen. Control flow analysis. SIGPLAN Notices, 5(7):1\u201319, July 1970.","journal-title":"SIGPLAN Notices"},{"key":"7_CR2","first-page":"385","volume-title":"Proc. IFIP Congress","author":"F.E. Allen","year":"1972","unstructured":"F.E. Allen. A basis for program optimization. In Proc. IFIP Congress, pages 385\u2013390, Amsterdam, Holland, 1972. North-Holland Pub.Co."},{"key":"7_CR3","first-page":"398","volume-title":"Proc. IFIP Congress","author":"F.E. Allen","year":"1974","unstructured":"F.E. Allen. Interprocedural data flow analysis. In Proc. IFIP Congress, pages 398\u2013402, Amsterdam, Holland, 1974. North-Holland Pub.Co."},{"key":"7_CR4","volume-title":"Technical Report RC 3923 (No. 17789)","author":"F.E. Allen","year":"1972","unstructured":"F.E. Allen and J. Cocke. Graph theoretic constructs for program control flow analysis. Technical Report RC 3923 (No. 17789), IBM, Thomas J. Watson Research Center, Yorktown Heights, New York, July 1972."},{"issue":"3","key":"7_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/360018.360025","volume":"19","author":"F.E. Allen","year":"1976","unstructured":"F.E. Allen and J. Cocke. A program data flow analysis procedure. Communications of the ACM, 19(3):137\u2013147, March 1976.","journal-title":"Communications of the ACM"},{"issue":"3","key":"7_CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/32.126773","volume":"18","author":"Z. Ammarguellat","year":"1992","unstructured":"Z. Ammarguellat. A control-flow normalization algorithm and its complexity. IEEE Transactions on Software Engineering, 18(3):237\u2013251, March 1992.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"7_CR7","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/321992.321999","volume":"24","author":"B.S. Baker","year":"1977","unstructured":"B.S. Baker. An algorithm for structuring flowgraphs. Journal of the ACM, 24(1):98\u2013120, January 1977.","journal-title":"Journal of the ACM"},{"issue":"5","key":"7_CR8","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/355592.365646","volume":"9","author":"C. B\u00f6hm","year":"1966","unstructured":"C. B\u00f6hm and G. Jacopini. Flow diagrams, Turing machines and languages with only two formation rules. Communications of the ACM, 9(5):366\u2013371, May 1966.","journal-title":"Communications of the ACM"},{"key":"7_CR9","unstructured":"C. Cifuentes. Reverse Compilation Techniques. PhD dissertation, Queensland University of Technology, School of Computing Science, July 1994."},{"key":"7_CR10","unstructured":"C. Cifuentes. Interprocedural dataflow decompilation. In print: Journal of Programming Languages, 1996."},{"issue":"7","key":"7_CR11","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1002\/spe.4380250706","volume":"25","author":"C. Cifuentes","year":"1995","unstructured":"C. Cifuentes and K.J. Gough. Decompilation of binary programs. Software \u2014 Practice and Experience, 25(7):811\u2013829, July 1995.","journal-title":"Software \u2014 Practice and Experience"},{"issue":"7","key":"7_CR12","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/390013.808480","volume":"5","author":"J. Cocke","year":"1970","unstructured":"J. Cocke. Global common subexpression elimination. SIGPLAN Notices, 5(7):20\u201325, July 1970.","journal-title":"SIGPLAN Notices"},{"key":"7_CR13","volume-title":"Taming control flow: A structured approach to eliminating goto statements","author":"A.M. Erosa","year":"1994","unstructured":"A.M. Erosa and L.J. Hendren. Taming control flow: A structured approach to eliminating goto statements. In Proceedings of the International Conference on Computer Languages, Universit\u00e9 Paul Sabatier, Toulouse, France, May 1994. IEEE Computer Society."},{"key":"7_CR14","volume-title":"Flow Analysis of Computer Programs","author":"M.S. Hecht","year":"1977","unstructured":"M.S. Hecht. Flow Analysis of Computer Programs. Elsevier North-Holland, Inc, 52 Vanderbilt Avenue, New York, New York 10017, 1977."},{"key":"7_CR15","unstructured":"B.C. Housel. A Study of Decompiling Machine Languages into High-Level Machine Independent Languages. PhD dissertation, Purdue University, Computer Science, August 1973."},{"issue":"11","key":"7_CR16","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1145\/359024.359031","volume":"23","author":"G.L. Steele Jr.","year":"1980","unstructured":"G.L. Steele Jr. and G.J. Sussman. Design of a LISP-based microprocessor. Communications of the ACM, 23(11):628\u2013645, November 1980.","journal-title":"Communications of the ACM"},{"issue":"1","key":"7_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(71)90018-4","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"D.E. Knuth and R.W. Floyd. Notes on avoiding go to statements. Information Processing Letters, 1(1):23\u201331, 1971.","journal-title":"Information Processing Letters"},{"issue":"3","key":"7_CR18","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S0022-0000(74)80043-7","volume":"9","author":"S.R. Kosaraju","year":"1974","unstructured":"S.R. Kosaraju. Analysis of structured programs. Journal of Computer and System Sciences, 9(3):232\u2013255, 1974.","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"U. Lichtblau. Decompilation of control structures by means of graph transformations. In Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, 1985.","DOI":"10.1007\/3-540-15198-2_18"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"U. Lichtblau. Recognizing rooted context-free flowgraph languages in polynomial time. In G. Rozenberg H. Ehrig, H.J. Kreowski, editor, Graph Grammars and their application to Computer Science, number 532 in Lecture Notes in Computer Science, pages 538\u2013548. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0017411"},{"issue":"4","key":"7_CR21","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"J. McCarthy. Recursive functions of symbolic expressions and their computation by machine, part I. Communications of the ACM, 3(4):184\u2013195, April 1960.","journal-title":"Communications of the ACM"},{"issue":"3","key":"7_CR22","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1093\/comjnl\/25.3.379","volume":"25","author":"G. Oulsnam","year":"1982","unstructured":"G. Oulsnam. Unravelling unstructured programs. The Computer Journal, 25(3):379\u2013387, 1982.","journal-title":"The Computer Journal"},{"issue":"7","key":"7_CR23","first-page":"654","volume":"36","author":"D.J. Pavey","year":"1993","unstructured":"D.J. Pavey and L.A. Winsborrow. Demonstrating equivalence of source code and PROM contents. The Computer Language, 36(7):654\u2013667, 1993.","journal-title":"The Computer Language"},{"issue":"4","key":"7_CR24","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1145\/48014.48021","volume":"35","author":"L. Ramshaw","year":"1988","unstructured":"L. Ramshaw. Eliminating go to's while preserving program structure. Journal of the ACM, 35(4):893\u2013920, October 1988.","journal-title":"Journal of the ACM"},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0096-0551(80)90007-7","volume":"5","author":"M. Sharir","year":"1980","unstructured":"M. Sharir. Structural analysis: A new approach to flow analysis in optimizing compilers. Computer Languages, 5:141\u2013153, 1980.","journal-title":"Computer Languages"},{"issue":"2","key":"7_CR26","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/151220.151227","volume":"36","author":"R.L. Sites","year":"1993","unstructured":"R.L. Sites, A. Chernoff, M.B. Kirk, M.P. Marks, and S.G. Robinson. Binary translation. Communications of the ACM, 36(2):69\u201381, February 1993.","journal-title":"Communications of the ACM"},{"issue":"1","key":"7_CR27","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1093\/comjnl\/20.1.45","volume":"20","author":"M.H. Williams","year":"1977","unstructured":"M.H. Williams. Generating structured flow diagrams: the nature of unstructuredness. The Computer Journal, 20(1):45\u201350, 1977.","journal-title":"The Computer Journal"},{"issue":"2","key":"7_CR28","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1093\/comjnl\/28.2.134","volume":"28","author":"M.H. Williams","year":"1985","unstructured":"M.H. Williams and G. Chen. Restructuring Pascal programs containing goto statements. The Computer Journal, 28(2):134\u2013137, 1985.","journal-title":"The Computer Journal"},{"issue":"2","key":"7_CR29","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/comjnl\/21.2.161","volume":"21","author":"M.H. Williams","year":"1978","unstructured":"M.H. Williams and H.L. Ossher. Conversion of unstructured flow diagrams to structured form. The Computer Journal, 21(2):161\u2013167, 1978.","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61053-7_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:29:04Z","timestamp":1619573344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61053-7_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610533","9783540499398"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-61053-7_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}