{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:11Z","timestamp":1725663371544},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540129257"},{"type":"electronic","value":"9783540388098"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-12925-1_33","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:59:50Z","timestamp":1330192790000},"page":"125-132","source":"Crossref","is-referenced-by-count":23,"title":["The program dependence graph and its use in optimization"],"prefix":"10.1007","author":[{"given":"Jeanne","family":"Ferrante","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karl J.","family":"Ottenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe D.","family":"Warren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"11_CR1","unstructured":"Allen, Frances E. and Cocke, John. A catalogue of optimizing transformations in Design and Optimization of Compilers (Randall Rustin, Ed.) Prentice-Hall (1972) 1\u201330."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Allen, J.R., Kennedy, Ken, Porterfield, Carrie, and Warren, Joe. Conversion of control dependence to data dependence. 10th Ann. ACM Symp. on Princ. of Prog. Lang. Austin, Texas (January, 1983) 177\u2013189.","DOI":"10.1145\/567067.567085"},{"key":"11_CR3","unstructured":"Arvind, Gostelow, Kim, and Plouffe, Wil. An asynchronous programming language and computing machine. University of California at Irvine Tech Report TR114A (December, 1978)"},{"issue":"11","key":"11_CR4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MC.1980.1653418","volume":"13","author":"J. B. Dennis","year":"1980","unstructured":"Dennis, Jack B. Data flow supercomputers. IEEE Computer 13, 11 (Nov. 1980) 48\u201356.","journal-title":"IEEE Computer"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Ferrante, Jeanne, and Ottenstein, Karl. A program form based on data dependency in predicate regions. 10th Ann. ACM Symp. on Princ. of Prog. Lang. Austin, Texas (January, 1983) 217\u2013231.","DOI":"10.1145\/567067.567089"},{"key":"11_CR6","unstructured":"Ferrante, Jeanne, Ottenstein, Karl, and Warren, Joe D. The program dependence graph and its use in optimization. In preparation."},{"issue":"1","key":"11_CR7","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/321921.321939","volume":"23","author":"S. Graham","year":"1976","unstructured":"Graham, Susan and Wegman, Mark. A fast and usually linear algorithm for global flow analysis. JACM 231 (January, 1976) 172\u2013202.","journal-title":"JACM"},{"issue":"5","key":"11_CR8","first-page":"448","volume":"16","author":"V. N. Kas'janov","year":"1975","unstructured":"Kas'janov, V.N. Distinguishing hammocks in a directed graph. Soviet Math. Doklady 165 (1975) 448\u2013450.","journal-title":"Soviet Math. Doklady"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Kuck, D. J; Kuhn, R. H., Padua, D. A.; Leasure, B. and Wolfe, M. Dependence graphs and compiler optimizations. 8th Ann. ACM Symp. on Princ. of Prog. Lang. Williamsburg, VA (Jan. 26\u201328, 1981) 207\u2013218.","DOI":"10.1145\/567532.567555"},{"key":"11_CR10","unstructured":"Ottenstein, Karl J. Data-flow graphs as an intermediate program form. Ph.D. Thesis. Computer Sciences Dept., Purdue Univ. (August 1978) 283 pages."},{"issue":"9","key":"11_CR11","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/TC.1980.1675676","volume":"29","author":"David A. A. Padua","year":"1980","unstructured":"Padua, David A., Kuck, David J., and Lawrie, Duncan. High-Speed multiprocessors and their compilers. IEEE Transactions on Computers 29,9 (September, 1980) 763\u2013776.","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR12","unstructured":"Padua Haiek, David Alejan. Multiprocessors: Discussion of some theoretical and practical problems. Ph.D. Thesis. Computer Sciences Dept., University of Illinois (1980)."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Ryder, Barbara G. Incremental data flow analysis. 10th Ann. ACM Symp. on Princ. of Prog. Lang. Austin, Texas (January, 1983) 167\u2013176.","DOI":"10.1145\/567067.567084"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Warren, Joe. A hierarchical basis for reordering transformations. 11th Ann. ACM Symp. on Princ. of Prog. Lang. Salt Lake City, Utah (January, 1984), 272\u2013282.","DOI":"10.1145\/800017.800539"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Wegman, Mark. Summarizing graphs by regular expressions. 10th Ann. ACM Symp. on Princ. of Prog. Lang. Austin, Texas (January, 1983) 203\u2013212.","DOI":"10.1145\/567067.567088"}],"container-title":["Lecture Notes in Computer Science","International Symposium on Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12925-1_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:54Z","timestamp":1605643614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12925-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540129257","9783540388098"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-12925-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}