{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:26Z","timestamp":1750308086314,"version":"3.41.0"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"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":["SIGPLAN Not."],"published-print":{"date-parts":[[2005,4]]},"abstract":"<jats:p>\n            This paper presents a simple and fast algorithm with proof of correctness for analyzing dominance relations of control flow graphs (CFGs). A dominator tree and dominance frontiers are obtained by reducing a DAG, which is obtained by adding dummy vertexes to the original CFG to transmit dominance relation of irreducible loops to the resultant DAG. A specific order of stacking vertexes eliminates the necessity to search for reduction candidates. The computational complexity of the algorithm for a real-world CFG with\n            <jats:bold>\n              <jats:italic>M<\/jats:italic>\n            <\/jats:bold>\n            edges is O(\n            <jats:bold>\n              <jats:italic>M<\/jats:italic>\n            <\/jats:bold>\n            ), which is also confirmed by analyzing about 1700 CFGs extracted from real programs.\n          <\/jats:p>","DOI":"10.1145\/1064165.1064169","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T18:08:27Z","timestamp":1131991707000},"page":"10-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Dominance analysis of irreducible CFGs by reduction"],"prefix":"10.1145","volume":"40","author":[{"given":"Tetsuo","family":"Saitou","sequence":"first","affiliation":[{"name":"The University of Electro-Communications, Chofu, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsugu","family":"Suzuki","sequence":"additional","affiliation":[{"name":"The University of Electro-Communications, Chofu, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tan","family":"Watanabe","sequence":"additional","affiliation":[{"name":"The University of Electro-Communications, Chofu, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/362835.362838"},{"volume-title":"Compiling","year":"1972","author":"Aho A.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804056"},{"volume-title":"Ullman","year":"1974","author":"Aho A.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80049-8"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0203006"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647891.739584"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/320176.320229"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/174675.177905"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/236114.236115"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/262004.262005"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797317263"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/316686.316687"},{"volume-title":"Compiler Construction and Optimization","year":"1999","author":"Nakata I.","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349330"},{"key":"e_1_2_1_18_1","first-page":"48","article-title":"A Simple Algorithm to Identify Dominance Relations in DAG, IPSJ (PRO13) Vol. 43 No","volume":"1","author":"Saitou T.","year":"2002","journal-title":"SIG"},{"key":"e_1_2_1_19_1","first-page":"72","volume-title":"T.: A Concise and Fast Algorithm for Irreducible Control Flow Graphs to Identify Immediate Dominators and Dominance Frontiers, IPSJ (PRO15)","author":"Saitou T.","year":"2002"},{"key":"e_1_2_1_20_1","unstructured":"COINS\n  : A Compiler Infrastructure http:\/\/www.coins-project.org.  COINS: A Compiler Infrastructure http:\/\/www.coins-project.org."},{"volume-title":"SSGRR 2003w - International Conference on Advances in Infrastructure for e-Business, e-Education, e-Science, e-Medicine, and Mobile Technologies on the Internet, L'Aquila, Italy, No. 54","year":"2003","author":"Sassa M.","key":"e_1_2_1_21_1"}],"container-title":["ACM SIGPLAN Notices"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064165.1064169","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1064165.1064169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:50Z","timestamp":1750262870000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064165.1064169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["10.1145\/1064165.1064169"],"URL":"https:\/\/doi.org\/10.1145\/1064165.1064169","relation":{},"ISSN":["0362-1340","1558-1160"],"issn-type":[{"type":"print","value":"0362-1340"},{"type":"electronic","value":"1558-1160"}],"subject":[],"published":{"date-parts":[[2005,4]]},"assertion":[{"value":"2005-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}