{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:21:16Z","timestamp":1725664876298},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_52","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:13:52Z","timestamp":1330272832000},"page":"44-58","source":"Crossref","is-referenced-by-count":1,"title":["Controlled Node Splitting"],"prefix":"10.1007","author":[{"given":"Johan","family":"Janssen","sequence":"first","affiliation":[]},{"given":"Henk","family":"Corporaal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Jan Hoogerbrugge and Henk Corporaal. Transport-triggering vs. operationtriggering. In Lecture Notes in Computer Science 786, Compiler Construction, pages 435\u2013449. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57877-3_29"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"D. Bernstein and M. Rodeh. Global instruction scheduling for superscalar machines. In Proc. of the ACM SIGPLAN 1991 conference on Programming Language Design and Implementation, pages 241\u2013255, June 1991.","DOI":"10.1145\/113445.113466"},{"issue":"3","key":"4_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/27632.27649","volume":"18","author":"B. G. Ryder","year":"1986","unstructured":"Barbara G. Ryder and Marvin C. Paull. Elimination algorithms for data flow analysis. ACM Computing Surveys, 18(3):277\u2013316, September 1986.","journal-title":"ACM Computing Surveys"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ana M. Erosa and Laurie J. Hendren. Taming control flow: A structured approach to eliminating goto statements. In Proceedings of the 1994 International Conference on Computer Languages, pages 229\u2013240, Toulouse, France, May 1994.","DOI":"10.1109\/ICCL.1994.288377"},{"issue":"3","key":"4_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/32.126773","volume":"18","author":"Z. Ammarguellat","year":"1992","unstructured":"Zahira Ammarguellat. A control-flow normalization algorithm and its complexity. IEEE Transaction on software engineering, 18(3):237\u2013251, March 1992.","journal-title":"IEEE Transaction on software engineering"},{"key":"4_CR6","unstructured":"John Cocke and Raymond E. Miller. Some analysis techniques for optimizing computer programs. In Proceedings of 2nd Hawaii Conference on System Sciences, pages 143\u2013146, 1969."},{"key":"4_CR7","series-title":"Programming Languages Series","volume-title":"Flow Analysis of Computer Programs","author":"M. S. Hecht","year":"1977","unstructured":"Matthew S. Hecht. Flow Analysis of Computer Programs. Programming Languages Series. Elsevier North-Holland, 1977."},{"key":"4_CR8","unstructured":"Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Company, 1988."},{"key":"4_CR9","unstructured":"J. Cocke. On certain graph-theoretic properties of programs. Technical Report Research Report RC-3391, T.J. Watson Research Center, 1971."},{"key":"4_CR10","first-page":"385","volume-title":"Proceedings of 1971 IFIP Congress","author":"F.E. Allen","year":"1971","unstructured":"F.E. Allen. A basis for program optimization. In Proceedings of 1971 IFIP Congress, pages 385\u2013390, Amsterdam, 1971. IEEE, North Holland Publ.."},{"issue":"3","key":"4_CR11","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. Commun. ACM, 19(3):137\u2013147, March 1976.","journal-title":"Commun. ACM"},{"issue":"2","key":"4_CR12","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0201014","volume":"1","author":"M.S. Hecht","year":"1972","unstructured":"M.S. Hecht and J.D. Ullman. Flow graph reducibility. SIAM J. Computing, 1(2):188\u2013202, 1972.","journal-title":"SIAM J. Computing"},{"key":"4_CR13","unstructured":"Johan Janssen and Henk Corporaal. Making graphs reducible with controlled node splitting. Technical Report JJ-9501, Delft University of Technology, Department of Electrical Engineering, 1995."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Henk Corporaal and Hans (J.M.) Mulder. MOVE: A framework for highperformance processor design. In Supercomputing-91, pages 692\u2013701, Albuquerque, November 1991.","DOI":"10.1145\/125826.126159"}],"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_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:03:49Z","timestamp":1605629029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61053-7_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610533","9783540499398"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-61053-7_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}