{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T23:10:39Z","timestamp":1771888239157,"version":"3.50.1"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,1,9]],"date-time":"2015-01-09T00:00:00Z","timestamp":1420761600000},"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":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2015,1,9]]},"abstract":"<jats:p>Demand-based dependence graphs (DDGs), such as the (Regionalized) Value State Dependence Graph ((R)VSDG), are intermediate representations (IRs) well suited for a wide range of program transformations. They explicitly model the flow of data and state, and only implicitly represent a restricted form of control flow. These features make DDGs especially suitable for automatic parallelization and vectorization, but cannot be leveraged by practical compilers without efficient construction and destruction algorithms. Construction algorithms remodel the arbitrarily complex control flow of a procedure to make it amenable to DDG representation, whereas destruction algorithms reestablish control flow for generating efficient object code. Existing literature presents solutions to both problems, but these impose structural constraints on the generatable control flow, and omit qualitative evaluation.<\/jats:p>\n          <jats:p>\n            The key contribution of this article is to show that there is no intrinsic structural limitation in the control flow directly extractable from RVSDGs. This fundamental result originates from an interpretation of loop repetition and decision predicates as computed continuations, leading to the introduction of the\n            <jats:italic>predicate continuation<\/jats:italic>\n            normal form. We provide an algorithm for constructing RVSDGs in predicate continuation form, and propose a novel destruction algorithm for RVSDGs in this form. Our destruction algorithm can generate arbitrarily complex control flow; we show this by proving that the original CFG an RVSDG was derived from can, apart from overspecific detail, be reconstructed perfectly. Additionally, we prove termination and correctness of these algorithms. Furthermore, we empirically evaluate the performance, the representational overhead at compile time, and the reduction in branch instructions compared to existing solutions. In contrast to previous work, our algorithms impose no additional overhead on the control flow of the produced object code. To our knowledge, this is the first scheme that allows the original control flow of a procedure to be recovered from a DDG representation.\n          <\/jats:p>","DOI":"10.1145\/2693261","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T20:02:10Z","timestamp":1421092930000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Perfect Reconstructability of Control Flow from Demand Dependence Graphs"],"prefix":"10.1145","volume":"11","author":[{"given":"Helge","family":"Bahmann","sequence":"first","affiliation":[{"name":"Google Z\u00fcrich, Switzerland"}]},{"given":"Nico","family":"Reissmann","sequence":"additional","affiliation":[{"name":"Norwegian University of Science and Technology, Trondheim, Norway"}]},{"given":"Magnus","family":"Jahre","sequence":"additional","affiliation":[{"name":"Norwegian University of Science and Technology, Trondheim, Norway"}]},{"given":"Jan Christian","family":"Meyer","sequence":"additional","affiliation":[{"name":"Norwegian University of Science and Technology, Trondheim, Norway"}]}],"member":"320","published-online":{"date-parts":[[2015,1,9]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Alfred V. Aho Monica S. Lam Ravi Sethi and Jeffrey D. Ullman. 2006. Compilers: Principles Techniques and Tools (2nd ed.). Addison-Wesley Longman Inc. New York NY.   Alfred V. Aho Monica S. Lam Ravi Sethi and Jeffrey D. Ullman. 2006. Compilers: Principles Techniques and Tools (2nd ed.). Addison-Wesley Longman Inc. New York NY."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.126773"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75278"},{"key":"e_1_2_1_4_1","unstructured":"orrado B\u00f6hm and Giuseppe Jacopini. 1979. Classics in software engineering. Chapter Flow Diagrams Turing Machines and Languages with Only Two Formation Rules. Yourdon Press New York NY 11--25.   orrado B\u00f6hm and Giuseppe Jacopini. 1979. Classics in software engineering. Chapter Flow Diagrams Turing Machines and Languages with Only Two Formation Rules. Yourdon Press New York NY 11--25."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2009.19"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(19980710)28:8%3C859::AID-SPE188%3E3.0.CO;2-8"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604141"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR.2008.4493300"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/202530.202534"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/75277.75280"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Ron Cytron Jeanne Ferrante Barry K. Rosen Mark N. Wegman and F. Kenneth Zadeck. 1991. Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. Technical Report. Providence RI.   Ron Cytron Jeanne Ferrante Barry K. Rosen Mark N. Wegman and F. Kenneth Zadeck. 1991. Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. Technical Report. Providence RI.","DOI":"10.1145\/115372.115320"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of 1994 IEEE International Conference on Computer Languages. IEEE Computer Society Press, 229--240","author":"Erosa Ana"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 6th Workshop on Programming Languages and Compilers for Parallel Computing. Springer-Verlag, 477--499","author":"Havlak Paul","year":"1993"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186736.1186737"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/267959.269971"},{"key":"e_1_2_1_17_1","volume-title":"CC (Lecture Notes in Computer Science)","author":"Johnson Neil"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/93548.93578"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium\u2014Volume 1 (JVM\u201901)","author":"Paleczny Michael","year":"2001"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73562"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.355.0779"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(80)90007-7"},{"key":"e_1_2_1_25_1","unstructured":"James Stanier. 2012. Removing and Restoring Control Flow with the Value State Dependence Graph. Ph.D. Dissertation. University of Sussex East Sussex England.  James Stanier. 2012. Removing and Restoring Control Flow with the Value State Dependence Graph. Ph.D. Dissertation. University of Sussex East Sussex England."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the Workshop on Intermediate Representations, Florent Bouchez, Sebastian Hack, and Eelco Visser (Eds.). 53--60","author":"Stanier James","year":"2011"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.1059"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2480741.2480743"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/207110.207115"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/567097.567098"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/103135.103136"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.177907"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 1994 International Conference on Parallel and Distributed Systems. 264--270","author":"Zhang Fubo"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2004.1274043"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2693261","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2693261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:31Z","timestamp":1750227211000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2693261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,9]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,1,9]]}},"alternative-id":["10.1145\/2693261"],"URL":"https:\/\/doi.org\/10.1145\/2693261","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,9]]},"assertion":[{"value":"2014-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}