{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:25:07Z","timestamp":1725564307679},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205364"},{"type":"electronic","value":"9783540400189"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40018-9_10","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:03:20Z","timestamp":1283727800000},"page":"141-158","source":"Crossref","is-referenced-by-count":0,"title":["Using Locality of Flow in Dataflow Analyses"],"prefix":"10.1007","author":[{"given":"D V","family":"Ravindra","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Compilers - Principles, Tools and Techniques","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers - Principles, Tools and Techniques. Addison Wesley, Reading (1986)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","volume":"15","author":"R. Backhouse","year":"1975","unstructured":"Backhouse, R., Carr\u00e9, B.: Regular algebra applied to path-finding problems. Journal of Institute of Mathematics and its Applications\u00a015, 161\u2013186 (1975)","journal-title":"Journal of Institute of Mathematics and its Applications"},{"key":"10_CR3","volume-title":"Graphs","author":"C. Berge","year":"1985","unstructured":"Berge, C.: Graphs, 2nd edn. North-Holland, Amsterdam (1985)","edition":"2"},{"key":"10_CR4","series-title":"Oxford Applied Mathematics and Computing Science Series","volume-title":"Graphs and Networks","author":"B. Carr\u00e9","year":"1979","unstructured":"Carr\u00e9, B.: Graphs and Networks. Oxford Applied Mathematics and Computing Science Series. Clarendon Press, Oxford (1979)"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/201059.201061","volume":"17","author":"C. Click","year":"1995","unstructured":"Click, C., Cooper, K.: Combining analyses, combining optimizations. ACM Transactions on Programming Languages and Systems\u00a017(2), 181\u2013196 (1995)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"J.B. Kam","year":"1977","unstructured":"Kam, J.B., Ullman, J.D.: Monotone dataflow analysis frameworks. Acta Informatica\u00a07(3), 305\u2013318 (1977)","journal-title":"Acta Informatica"},{"key":"10_CR7","unstructured":"Kennedy, K.: A survey of data flow analysis techniques, pp. 5\u201354. In: Muchnick and Jones [13] (1981)"},{"issue":"5","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1145\/186025.186043","volume":"16","author":"U. Khedkar","year":"1994","unstructured":"Khedkar, U., Dhamdhere, D.M.: A generalized theory of bit-vector dataflow analysis. ACM Transactions on Programming Languages and Systems\u00a016(5), 1472\u20131511 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"6","key":"10_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/606666.606676","volume":"34","author":"U. Khedkhar","year":"1999","unstructured":"Khedkhar, U., Dhamdhere, D.M.: Bidirectional analysis: Myths and reality. ACM SIGPLAN Notices\u00a034(6), 47\u201357 (1999)","journal-title":"ACM SIGPLAN Notices"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1145\/183432.183443","volume":"16","author":"J. Knoop","year":"1994","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Optimal code motion. ACM Transactions on Programming Languages and Systems\u00a016(4), 1117\u20131155 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Lerner, S., Grove, D., Chambers, C.: Composing dataflow analyses and transformations. In: 29st Annual ACM Symposium on Principles of Programming Languages, pp. 270\u2013282 (2002)","DOI":"10.1145\/565816.503298"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/359060.359069","volume":"22","author":"E. Morel","year":"1979","unstructured":"Morel, E., Renvoise, C.: Global optimization by supression of partial redundancies. Communications of the ACM\u00a022(2), 96\u2013103 (1979)","journal-title":"Communications of the ACM"},{"volume-title":"Program Flow Analysis: Theory and Applications","year":"1981","key":"10_CR13","unstructured":"Muchnick, S.S., Jones, N.D. (eds.): Program Flow Analysis: Theory and Applications. Prentice Hall, Englewood Cliffs (1981)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Neilson, H.R., Nielson, F.: Bounded fixed point iteration. In: 19th Annual ACM Symposium on Principles of Programming Languages, pp. 71\u201382 (1992)","DOI":"10.1145\/143165.143182"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0167-6423(00)00016-2","volume":"39","author":"O. R\u00fcthing","year":"2001","unstructured":"R\u00fcthing, O.: Code motion in the presence of critical edges without bidirectional data flow analysis. Science of Computer Programming\u00a039, 2\u201329 (2001)","journal-title":"Science of Computer Programming"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0096-0551(80)90007-7","volume":"5","author":"M. Sharir","year":"1980","unstructured":"Sharir, M.: Structural analysis: A new approach to flow analysis in optimizing compilers. Computer Languages\u00a05(3), 141\u2013153 (1980)","journal-title":"Computer Languages"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"R.E. Tarjan","year":"1981","unstructured":"Tarjan, R.E.: Fast algorithms for solving path problems. Journal of ACM\u00a028(3), 594\u2013614 (1981)","journal-title":"Journal of ACM"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/103135.103136","volume":"13","author":"M.N. Wegman","year":"1991","unstructured":"Wegman, M.N., Zadeck, F.K.: Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems\u00a013(2), 181\u2013210 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40018-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:40:36Z","timestamp":1558302036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40018-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205364","9783540400189"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40018-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}