{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T05:23:21Z","timestamp":1749878601810},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_60","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"677-688","source":"Crossref","is-referenced-by-count":10,"title":["Finding Dominators in Practice"],"prefix":"10.1007","author":[{"given":"Loukas","family":"Georgiadis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spyridon","family":"Triantafyllis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David I.","family":"August","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","unstructured":"The IMPACT compiler, http:\/\/www.crhc.uiuc.edu\/IMPACT"},{"key":"60_CR2","unstructured":"The Standard Performance Evaluation Corp., http:\/\/www.spec.org\/"},{"key":"60_CR3","volume-title":"Compilers: Principles, Techniques, and Tools","author":"V. Aho","year":"1986","unstructured":"Aho, V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading (1986)"},{"key":"60_CR4","volume-title":"Principles of Compilers Design","author":"V. Aho","year":"1977","unstructured":"Aho, V., Ullman, J.D.: Principles of Compilers Design. Addison-Wesley, Reading (1977)"},{"key":"60_CR5","unstructured":"Allen, F.E., Cocke, J.: Graph theoretic constructs for program control flow analysis. Technical Report IBM Res. Rep. RC 3923, IBM T.J. Watson Research Center (1972)"},{"issue":"6","key":"60_CR6","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1137\/S0097539797317263","volume":"28","author":"S. Alstrup","year":"1999","unstructured":"Alstrup, S., Harel, D., Lauridsen, P.W., Thorup, M.: Dominators in linear time. SIAM Journal on Computing\u00a028(6), 2117\u20132132 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"60_CR7","doi-asserted-by":"crossref","unstructured":"Amyeen, M.E., Fuchs, W.K., Pomeranz, I., Boppana, V.: Fault equivalence identification using redundancy information and static and dynamic extraction. In: Proceedings of the 19th IEEE VLSI Test Symposium (March 2001)","DOI":"10.1109\/VTS.2001.923428"},{"issue":"6","key":"60_CR8","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1145\/295656.295663","volume":"20","author":"L. Buchsbaum","year":"1998","unstructured":"Buchsbaum, L., Kaplan, H., Rogers, A., Westbrook, J.R.: A new, simpler linear-time dominators algorithm. ACM Transactions on Programming Languages and Systems\u00a020(6), 1265\u20131296 (1998) Corrigendum to appear","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"60_CR9","unstructured":"Cooper, K.D., Harvey, T.J., Kennedy, K.: A simple, fast dominance algorithm. Available online at http:\/\/www.cs.rice.edu\/~keith\/EMBED\/dom.pdf"},{"issue":"4","key":"60_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems\u00a013(4), 451\u2013490 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"60_CR11","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pp. 434\u2013443 (1990)"},{"key":"60_CR12","unstructured":"Georgiadis, L., Tarjan, R.E.: Finding dominators revisited. In: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, pp. 862\u2013871 (2004)"},{"issue":"3","key":"60_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/321832.321835","volume":"21","author":"M.S. Hecht","year":"1974","unstructured":"Hecht, M.S., Ullman, J.D.: Characterizations of reducible flow graphs. Journal of the ACM\u00a021(3), 367\u2013375 (1974)","journal-title":"Journal of the ACM"},{"key":"60_CR14","unstructured":"Holloway, G., Young, C.: The flow analysis and transformation libraries of Machine SUIF. In: Proceedings of the 2nd SUIF Compiler Workshop (1997)"},{"key":"60_CR15","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J.B. Kam","year":"1976","unstructured":"Kam, J.B., Ullman, J.D.: Global data flow analysis and iterative algorithms. Journal of the ACM\u00a023, 158\u2013171 (1976)","journal-title":"Journal of the ACM"},{"key":"60_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/spe.4380010203","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"Knuth, D.E.: An empirical study of FORTRAN programs. Software Practice and Experience\u00a01, 105\u2013133 (1971)","journal-title":"Software Practice and Experience"},{"issue":"1","key":"60_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/357062.357071","volume":"1","author":"T. Lengauer","year":"1979","unstructured":"Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. ACM Transactions on Programming Languages and Systems\u00a01(1), 121\u2013141 (1979)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"8","key":"60_CR18","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1145\/361532.361566","volume":"15","author":"P.W. Purdom Jr.","year":"1972","unstructured":"Purdom Jr., P.W., Moore, E.F.: Algorithm 430: Immediate predominators in a directed graph. Communications of the ACM\u00a015(8), 777\u2013778 (1972)","journal-title":"Communications of the ACM"},{"key":"60_CR19","doi-asserted-by":"crossref","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for maintaining the dominator tree of a reducible flowgraph. In: Proceedings of the 21st ACM SIGPLANSIGACT symposium on Principles of programming languages, pp. 287\u2013296 (1994)","DOI":"10.1145\/174675.177905"},{"key":"60_CR20","doi-asserted-by":"crossref","unstructured":"Sharir, M.: Structural analysis: A new approach to flow analysis in optimizing compilers, vol.\u00a05, pp. 141\u2013153 (1980)","DOI":"10.1016\/0096-0551(80)90007-7"},{"key":"60_CR21","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences\u00a026, 362\u2013391 (1983)","journal-title":"Journal of Computer and System Sciences"},{"key":"60_CR22","doi-asserted-by":"crossref","unstructured":"Sweany, P.H., Beaty, S.J.: Dominator-path scheduling: A global scheduling method. In: Proceedings of the 25th International Symposium on Microarchitecture, pp. 260\u2013263 (1992)","DOI":"10.1109\/MICRO.1992.697028"},{"issue":"1","key":"60_CR23","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/0203006","volume":"3","author":"R.E. Tarjan","year":"1974","unstructured":"Tarjan, R.E.: Finding dominators in directed graphs. SIAM Journal on Computing\u00a03(1), 62\u201389 (1974)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"60_CR24","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E.: Applications of path compression on balanced trees. Journal of the ACM\u00a026(4), 690\u2013715 (1979)","journal-title":"Journal of the ACM"},{"issue":"2","key":"60_CR25","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., van Leeuwen, J.: Worst-case analysis of set union algorithms. Journal of the ACM\u00a031(2), 245\u2013281 (1984)","journal-title":"Journal of the ACM"},{"key":"60_CR26","unstructured":"The CAD Benchmarking Lab, North Carolina State University. ISCAS 1989 benchmark information, http:\/\/www.cbl.ncsu.edu\/www\/CBL_Docs\/iscas89.html"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:44:41Z","timestamp":1605761081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}