{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T18:51:42Z","timestamp":1792867902099,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540588689","type":"print"},{"value":"9783540491347","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0025882","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:12:25Z","timestamp":1132395145000},"page":"234-250","source":"Crossref","is-referenced-by-count":39,"title":["Flow-insensitive interprocedural alias analysis in the presence of pointers"],"prefix":"10.1007","author":[{"given":"Michael","family":"Burke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Carini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jong-Deok","family":"Choi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Hind","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A. V. Aho","year":"1972","unstructured":"A. V. Aho, M. R. Garey, and J. D. Ullman. The transitive reduction of a directed graph. SIAM Journal on Computing, 1(2):131\u2013137, 1972.","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"16_CR2","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/0743-7315(88)90015-9","volume":"5","author":"F. Allen","year":"1988","unstructured":"Frances Allen, Michael Burke, Philippe Charles, Ron Cytron, and Jeanne Ferrante. An overview of the ptran analysis system for multiprocessing. Proceedings of the ACM 1987 International Conference on Supercomputing, 1987. Also published in The Journal of Parallel and Distributed Computing, Oct., 1988, 5(5) pages 617\u2013640.","journal-title":"The Journal of Parallel and Distributed Computing"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Randy Allen, David Callahan, and Ken Kennedy. Automatic decomposition of scientific programs for parallel execution. Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 63\u201376, January 1987.","DOI":"10.1145\/41625.41631"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"John Banning. An efficient way to find the side effects of procedure calls and the aliases of variables. 6th Annual ACM Symposium on the Principles of Programming Languages, pages 29\u201341, January 1979.","DOI":"10.1145\/567752.567756"},{"key":"16_CR5","unstructured":"Michael Burke. An interval-based approach to exhaustive and incremental interprocedural data flow analysis. Technical report, IBM Research, August 1987. Report RC12702."},{"issue":"3","key":"16_CR6","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/78969.78963","volume":"12","author":"M. Burke","year":"1990","unstructured":"Michael Burke. An interval-based approach to exhaustive and incremental inter procedural data-flow analysis. ACM Transactions on Programming Languages and Systems, 12(3):341\u2013395, July 1990.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Michael Burke, Paul Carini, Jong-Deok Choi, and Michael Hind. Efficient flow insensitive alias analysis in the presence of pointers. Technical report RC 19546, IBM T. J. Watson Research Center, September 1994.","DOI":"10.1007\/BFb0025882"},{"issue":"4","key":"16_CR8","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/32.54302","volume":"16","author":"D. Callahan","year":"1990","unstructured":"D. Callahan, A. Carle, M. W. Hall, and K. Kennedy. Constructing the procedure call multigraph. IEEE Transactions on Software Engineering, 16(4):483\u2013487, April 1990.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"16_CR9","unstructured":"Jong-Deok Choi, Michael Burke, and Paul Carini. Efficient flow-sensitive inter procedural computation of pointer-induced aliases and side effects. Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, January 1993."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Jong-Deok Choi and Jeanne Ferrante. Static slicing in the presence of GOTO statements. ACM Transactions on Programming Languages and Systems, 1994. To appear.","DOI":"10.1145\/183432.183438"},{"key":"16_CR11","first-page":"157","volume-title":"On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications","author":"A. Deutsch","year":"1990","unstructured":"Alain Deutsch. On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications. In 17th Annual ACM Symposium on the Principles of Programming Languages, pages 157\u2013168, San Francisco, January 1990. ACM Press."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In SIGPLAN '94 Conference on Programming Language Design and Implementation, 1994.","DOI":"10.1145\/178243.178263"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Maryam Emami, Rakesh Ghiya, and Laurie J. Hendren. Context-sensitive inter procedural points-to analysis in the presence of function pointers. In SIGPLAN '94 Conference on Programming Language Design and Implementation, 1994.","DOI":"10.1145\/178243.178264"},{"key":"16_CR14","unstructured":"Dennis Gannon, Vincent A. Guarna, Jr., and Jenq Kuen Lee. Static analysis and runtime support for parallel execution of C. Proceedings of the Second Workshop on Languages and Compilers for Parallel Computing, August 1989."},{"issue":"1","key":"16_CR15","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/321921.321939","volume":"23","author":"S. L. Graham","year":"1976","unstructured":"Susan L. Graham and Mark Wegman. A fast and usually linear algorithm for global flow analysis. Journal of the Association for Computing Machinery, 23(1):172\u2013202, January 1976.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"16_CR16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/151640.151643","volume":"1","author":"M. W. Hall","year":"1992","unstructured":"Mary W. Hall and Ken Kennedy. Efficient call graph analysis. ACM Letters on Programming Languages and Systems, 1(3):227\u2013242, September 1992.","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"2","key":"16_CR17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/174662.174663","volume":"16","author":"M. H. Harrold","year":"1994","unstructured":"Mary Hean Harrold and Mary Lou Soffa. Efficient computation of interprocedural definition \u2014 use chains. ACM Transactions on Programming Languages and Systems, 16(2):175\u2013204, March 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"16_CR18","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/77606.77608","volume":"12","author":"S. Horwitz","year":"1990","unstructured":"Susan Horwitz, Thomas Reps, and David Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(1):26\u201360, January 1990.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"16_CR19","first-page":"176","volume":"2","author":"W. L. Harrison III","year":"1989","unstructured":"W. L. Harrison III. The interprocedural analysis and automatic parallelisation of Scheme programs. Lisp and Symbolic Computation, 2(3):176\u2013396, Octobet 1989.","journal-title":"Lisp and Symbolic Computation"},{"issue":"1","key":"16_CR20","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J. B. Kam","year":"1976","unstructured":"John B. Kam and Jeffrey D. Ullman. Global data flow analysis and iterative algorithms. JACM, 23, 1:158\u2013171, January 1976.","journal-title":"JACM"},{"issue":"3","key":"16_CR21","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1109\/71.86108","volume":"2","author":"K. Kennedy","year":"1991","unstructured":"K. Kennedy, K. S. McKinley, and C. Tseng. Interactive parallel programming using the parascope editor. IEEE Transactions on Parallel and Distributed Systems, 2(3):329\u2013341, July 1991.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Arun Lakhotia. Constructing call multigraphs using dependence graphs. In 20th Annual ACM SIGACT-SIGPLAN Symposium on the Principles of Programming Languages, pages 273\u2013284. ACM, January 1993.","DOI":"10.1145\/158511.158647"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"William Landi and Barbara G. Ryder. A safe approximate algorithm for interprocedural pointer aliasing. Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, pages 235\u2013248, June 1992.","DOI":"10.1145\/143103.143137"},{"issue":"7","key":"16_CR24","first-page":"21","volume":"23","author":"J. R. Larus","year":"1988","unstructured":"J. R. Larus and P. N. Hilfinger. Detecting conflicts between structure accesses. Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation, 23(7):21\u201334, July 1988.","journal-title":"Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation"},{"key":"16_CR25","unstructured":"James Richard Larus. Restructuring Symbolic Programs for Concurrent Execution on Multiprocessors. PhD thesis, University of California, 1989. Technical Report No. UCB\/CSD 89\/502."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"T. J. Marlowe and B. Ryder. An efficient hybrid algorithm for incremental data flow analysis. 17th Annual ACM Symposium on the Principles of Programming Languages, pages 184\u2013196, January 1990.","DOI":"10.1145\/96709.96728"},{"issue":"9","key":"16_CR27","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/165364.165387","volume":"28","author":"T. Marlowe","year":"1993","unstructured":"Thomas Marlowe, William Landi, Barbara Ryder, Jong-Deok Choi, Michael Burke, and Paul Carini. Pointer-induced aliasing: A clarification. SIGPLAN Notices, 28(9):67\u201370, September 1993.","journal-title":"SIGPLAN Notices"},{"key":"16_CR28","unstructured":"T.J. Marlowe, B.G. Ryder, and M.G. Burke. Defining flow-sensitivity in data flow problems. In Preparation, 1994."},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Torben \u00c6 Mogensen. Binding time analysis for polymorphically typed higher-order languages. In Proceedings TAPSOFT, volume 352 of Lecture Notes in Computer Science, pages 298\u2013312. Springer Verlag, 1989.","DOI":"10.1007\/3-540-50940-2_43"},{"issue":"1","key":"16_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01409744","volume":"18","author":"A. Neirynck","year":"1989","unstructured":"A. Neirynck, P. Panangaden, and A. J. Demers. Effect analysis in higher-order languages. International Journal of Parallel Programming, 18(1):1\u201317, 1989.","journal-title":"International Journal of Parallel Programming"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Barbara Ryder. Constructing the call graph of a program. IEEE Software Engineering, May 1979.","DOI":"10.1109\/TSE.1979.234183"},{"key":"16_CR32","first-page":"39","volume-title":"Replacing function parameters by global variables","author":"P. Sestoft","year":"1989","unstructured":"Peter Sestoft. Replacing function parameters by global variables. In Conference on Functional Programming Languages and Computer Architecture, pages 39\u201353, London, September 1989. ACM Press."},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Olin Shivers. Control flow analysis in Scheme. In SIGPLAN '88 Conference on Programming Language Design and Implementation, pages 164\u2013174, June 1988.","DOI":"10.1145\/53990.54007"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"William Weihl. Interprocedural data flow analysis in the presence of pointer, procedure variables and label variables. Conf. Rec. Seventh ACM Symposium on Principles of Programming Languages, 1980.","DOI":"10.1145\/567446.567455"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0025882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:50:45Z","timestamp":1586569845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0025882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540588689","9783540491347"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/bfb0025882","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}