{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:20:27Z","timestamp":1648952427590},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1981,11,1]],"date-time":"1981-11-01T00:00:00Z","timestamp":373420800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1981,11]]},"DOI":"10.1007\/bf00289306","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T23:28:19Z","timestamp":1096932499000},"page":"253-273","source":"Crossref","is-referenced-by-count":0,"title":["Pathlistings applied to data flow analysis"],"prefix":"10.1007","volume":"16","author":[{"given":"Jayashree","family":"Ramanathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken","family":"Kennedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The theory of parsing, translation and compiling, Vol. I: Parsing","author":"A.V. Aho","year":"1973","unstructured":"Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling, Vol. I: Parsing. Englewood Cliffs, N.J.: Prentice-Hall 1973"},{"key":"CR2","volume-title":"The theory of parsing translation, and compiling, Vol. II: Compiling","author":"A.V. Aho","year":"1973","unstructured":"Aho, A.V., Ullman, J.C.: The theory of parsing translation, and compiling, Vol. II: Compiling. Englewood Cliffs, N.J.: Prentice-Hall 1973"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Ullman, J.D.: Node listings for reducible flow graphs. Proceedings of Seventh Annual ACM Symposium on Theory of Computing Albuquerque, N.M., pp. 177?185, 1975","DOI":"10.1145\/800116.803767"},{"key":"CR4","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974"},{"key":"CR5","first-page":"1","volume-title":"A catalogue of optimizing transformations, design and optimization of compilers","author":"F.E. Allen","year":"1972","unstructured":"Allen, F.E., Cocke, J.: A catalogue of optimizing transformations, design and optimization of compilers, pp. 1?30. (R. Rustin, ed.) Englewood Cliffs, N.J.: Prentice-Hall 1972"},{"key":"CR6","unstructured":"Cocke, J., Schwartz, J.T.: Programming languages and their compilers: preliminary notes. Computer Science Department, New York University, 1970"},{"key":"CR7","first-page":"172","volume":"23","author":"S.L. Graham","year":"1976","unstructured":"Graham, S.L., Wegman, M.: A fast and usually linear algorithm for global flow analysis. J.A.C.M. 23, 172?202 (1976)","journal-title":"J.A.C.M."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0201014","volume":"1","author":"M.S. Hecht","year":"1972","unstructured":"Hecht, M.S., Ullman, J.D.: Flow graph reducibility. SIAM J. Comput. 1, 188?202 (1972)","journal-title":"SIAM J. Comput."},{"key":"CR9","doi-asserted-by":"crossref","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. JACM 21, 367?375 (1974)","journal-title":"JACM"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1137\/0204044","volume":"4","author":"M.S. Hecht","year":"1975","unstructured":"Hecht, M.S., Ullman, J.D.: A simple algorithm for global data flow analysis problems. SIAM J. Comput. 4, 519?521 (1975)","journal-title":"SIAM J. Comput."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1080\/00207167108803048","volume":"3","author":"K. Kennedy","year":"1971","unstructured":"Kennedy, K.: A global flow analysis algorithm. Internat. J. Comput. Math. 3, 5?15 (1971)","journal-title":"Internat. J. Comput. Math."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/00207167208803056","volume":"3","author":"K. Kennedy","year":"1972","unstructured":"Kennedy, K.: Safety of code motion. Internat. J. Comput. Math. 3, 117?130 (1972)","journal-title":"Internat. J. Comput. Math."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Kennedy, K.: Node listings applied to data flow analysis. Conference Record of the Second ACM Symposium on Principles of Programming Languages, Palo Alto, California, pp. 10?21, 1975","DOI":"10.1145\/512976.512978"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Kennedy, K., Zucconi, L.: Applications of a graph grammar for program control flow analysis. Conf. Record of the Fourth ACM Symposium on the Principles of Programming Languages, Los Angeles, pp. 72?85 1977","DOI":"10.1145\/512950.512958"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Killdall, G.A.: A unified approach to global program optimization. Conference Record of ACM Symposium on Principles of Programming Languages. Boston, pp. 194?206, 1973","DOI":"10.1145\/512927.512945"},{"key":"CR16","doi-asserted-by":"crossref","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 1, 105?134 (1971)","journal-title":"Software practice and Experience"},{"key":"CR17","first-page":"158","volume":"23","author":"J.B. Kam","year":"1976","unstructured":"Kam, J.B., Ullman, J.D.: Global data flow analysis and iterative algorithms. J.A.C.M. 23, 158?171 (1976)","journal-title":"J.A.C.M."},{"key":"CR18","series-title":"IBM Research Report RC5477","volume-title":"Lower bounds on the lengths of node sequences in directed graphs","author":"G. Markowsky","year":"1975","unstructured":"Markowsky, G., Tarjan, R.E.: Lower bounds on the lengths of node sequences in directed graphs. IBM Research Report RC5477, IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y., 1975"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1145\/359842.359849","volume":"20","author":"B.K. Rosen","year":"1977","unstructured":"Rosen, B.K.: High-level data flow analysis. Communications of the ACM. 20, 712?724 (1977)","journal-title":"Communications of the ACM."},{"key":"CR20","volume-title":"A mathematical theory of global program optimization","author":"M. Schaefer","year":"1973","unstructured":"Schaefer, M.: A mathematical theory of global program optimization. Englewood Cliffs, N.J.: Prentice-Hall 1973"},{"key":"CR21","doi-asserted-by":"crossref","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 J. Comput. 3, 62?89 (1974)","journal-title":"SIAM J. Comput."},{"key":"CR22","volume-title":"Solving path problems on directed graphs. Draft","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Solving path problems on directed graphs. Draft, Computer Science Department, Stanford University, Stanford, California, 1975"},{"key":"CR23","series-title":"STAN-CS-75-512","volume-title":"Applications of path compression on balanced trees","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Applications of path compression on balanced trees. STAN-CS-75-512, Computer Science Department, Stanford University, Stanford, California, 1975"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. JACM 22, 215?225 (1975)","journal-title":"JACM"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00289078","volume":"2","author":"J.D. Ullman","year":"1973","unstructured":"Ullman, J.D.: Fast algorithms for the elimination of common subexpressions. Acta Informat. 2, 191?213 1973)","journal-title":"Acta Informat."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289306.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289306\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:47Z","timestamp":1554743687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,11]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,11]]}},"alternative-id":["BF00289306"],"URL":"https:\/\/doi.org\/10.1007\/bf00289306","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,11]]}}}