{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:00Z","timestamp":1725664980450},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617396"},{"type":"electronic","value":"9783540706748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61739-6_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:19:49Z","timestamp":1330294789000},"page":"42-51","source":"Crossref","is-referenced-by-count":2,"title":["Generalized dominators for structured programs"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Alstrup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter W.","family":"Lauridsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikkel","family":"Thorup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"4_CR1","unstructured":"A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"S. Alstrup, J. Clausen, and K. J\u00d8rgensen. An O(\u00a6V\u00a6*\u00a6E\u00a6) algorithm for finding immediate multiple-vertex dominators. Technical Report DIKU-TR-96\/4, Deparment of Computer Science, University of Copenhagen, 1996. Revised version with minor change accepted to Information Processing Letters.","DOI":"10.1016\/0020-0190(96)00085-3"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"H. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In Proc. 25th ACM. Symp. on theory of Comp.(STOC'93), pages 226\u2013234, 1993.","DOI":"10.1145\/167088.167161"},{"key":"4_CR4","unstructured":"G.R. Gao, Y.-F Lee, and V.C. Sreedhar. DJ-graphs and their application to flow-graph analyses. Technical Report 70, McGill University, School of Computer Science, ACAPS, May 1994."},{"key":"4_CR5","first-page":"62","volume":"22","author":"G.R. Gao","year":"1995","unstructured":"G.R. Gao and V.C. Sreedhar. A linear time algorithm for placing \u03a6-nodes. In ACM Symp. on the Principles of Programming Languages (POPL'95), volume 22, pages 62\u201373, January 1995.","journal-title":"ACM Symp. on the Principles of Programming Languages (POPL'95)"},{"key":"4_CR6","first-page":"246","volume":"19","author":"R. Gupta","year":"1992","unstructured":"R. Gupta. Generalized dominators and post-dommators. In ACM Symp. on Principles of Programming Languages (POPL'92), volume 19, pages 246\u2013257, 1992.","journal-title":"ACM Symp. on Principles of Programming Languages (POPL'92)"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(94)00192-2","volume":"53","author":"R. Gupta","year":"1995","unstructured":"R. Gupta. Generalized dominators. Information processing letters, 53:193\u2013200, 1995.","journal-title":"Information processing letters"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"D. Harel. A linear time algorithm for finding dominator in flow graphs and related problems. In Proc. 17th Ann. ACM Symp. on theory of Comp. (STOC'85), pages 185\u2013194, 1985.","DOI":"10.1145\/22145.22166"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1137\/0204044","volume":"4","author":"M.S. Hecht","year":"1975","unstructured":"M.S. Hecht and J.D. Ullman. A simple algorithm for global data flow analysis of programs. SIAM J. Comput., 4:519\u2013532, 1975.","journal-title":"SIAM J. Comput."},{"key":"4_CR10","volume-title":"The C programming language","author":"B.R. Kernighan","year":"1978","unstructured":"B.R. Kernighan and D.M. Ritchie. The C programming language. Prentice-Hall, New-Jersey, 1978."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/357062.357071","volume":"1","author":"T. Lengauer","year":"1979","unstructured":"T. Lengauer and R.E. Tarjan. A fast algorithm for finding dominators in a flow-graph. ACM Trans. Programming Languages Systems, 1:121\u2013141, 1979.","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"6","key":"4_CR12","first-page":"1","volume":"1","author":"P. Naur","year":"1963","unstructured":"P. Naur. Revised report on the algorithmic language algol 60. Comm. ACM, 1(6):1\u201317, 1963.","journal-title":"Comm. ACM"},{"issue":"8","key":"4_CR13","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1145\/361532.361566","volume":"15","author":"P.W. Purdom","year":"1972","unstructured":"P.W. Purdom and E.F. Moore. Immediate predominators in a directed graph. Comm. ACM, 15(8):777\u2013778, 1972.","journal-title":"Comm. ACM"},{"issue":"1","key":"4_CR14","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1137\/0203006","volume":"3","author":"R.E. Tarjan","year":"1974","unstructured":"R.E. Tarjan. Finding dominators in directed graphs. SIAM J. Comput., 3(1):62\u201389, 1974.","journal-title":"SIAM J. Comput."},{"key":"4_CR15","unstructured":"M. Thorup. Structured programs have small tree-width and good register allocation. Technical Report DIKU-TR-95\/18 (revised version), Deparaient of Computer Science, University of Copenhage, 1995."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF00264291","volume":"1","author":"N. Wirth","year":"1971","unstructured":"N. Wirth. The programming language pascal. Acta informatica, 1:35\u201363, 1971.","journal-title":"Acta informatica"},{"key":"4_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-96878-5","volume-title":"Programming in modula-2","author":"N. Wirth","year":"1985","unstructured":"N. Wirth. Programming in modula-2(3rd corr.ed). Springer-verlag, Berlin, New York, 1985.","edition":"3rd corr.ed"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61739-6_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:04Z","timestamp":1605647404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61739-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617396","9783540706748"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61739-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}