{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:29:07Z","timestamp":1748334547971},"reference-count":27,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0167-8191(98)00023-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:15:57Z","timestamp":1027602957000},"page":"505-525","source":"Crossref","is-referenced-by-count":9,"title":["Data dependence analysis in programs with pointers"],"prefix":"10.1016","volume":"24","author":[{"given":"Wolfram","family":"Amme","sequence":"first","affiliation":[]},{"given":"Eberhard","family":"Zehendner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(98)00023-4_BIB1","unstructured":"S. Amarasinghe, J. Ander, C.W. Tseng, An overview of the SUIF compiler for scalable parallel machines, Proceedings of the SIAM Conference on Parallel Processing for Scientific Computing, San Francisco, 1995, pp. 662\u2013667."},{"key":"10.1016\/S0167-8191(98)00023-4_BIB2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/32.286418","article-title":"Interprocedural def-use associations for C systems with single level pointers","volume":"22","author":"Pande","year":"1994","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0167-8191(98)00023-4_BIB3","doi-asserted-by":"crossref","unstructured":"D.I.S. Marx, P.G. Frankl, The path-wise approach to data flow testing with pointer variables, Proceedings of the 1996 International Symposium on Software Testing and Analysis, San Diego, 1996, pp. 135\u2013146.","DOI":"10.1145\/229000.226311"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB4","unstructured":"H. Zima, B. Chapman, Supercompilers for Parallel and Vector Computers, ACM Press, New York, 1990."},{"key":"10.1016\/S0167-8191(98)00023-4_BIB5","doi-asserted-by":"crossref","unstructured":"P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixed points, Proceedings of the 4th Annual ACM Symposium on Principles of Programming Languages, New York, 1977, pp. 238\u2013252.","DOI":"10.1145\/512950.512973"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB6","unstructured":"M.S. Hecht, Flow Analysis of Computer Programs, Elsevier, Amsterdam, 1977."},{"key":"10.1016\/S0167-8191(98)00023-4_BIB7","unstructured":"A.V. Aho, R. Sethi, J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1986."},{"key":"10.1016\/S0167-8191(98)00023-4_BIB8","doi-asserted-by":"crossref","unstructured":"W. Landi, B.G. Ryder, Pointer-induced aliasing: a problem classification, Conference Record of the 18th Annual ACM Symposium on Principles of Programming Languages, Orlando, 1991, pp. 93\u2013103.","DOI":"10.1145\/99583.99599"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB9","doi-asserted-by":"crossref","unstructured":"S. Horwitz, P. Pfeiffer, T. Reps, Dependence analysis for pointer variables, Proceedings of the ACM SIGPLAN Symposium on Compiler Construction, Portland, 1989, pp. 28\u201340.","DOI":"10.1145\/73141.74821"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB10","doi-asserted-by":"crossref","unstructured":"W. Amme, E. Zehendner, A\/D graphs: a data structure for data dependence analysis in programs with pointers, Proceedings of the 4th PASA Workshop Parallel Systems and Algorithms (J\u00fclich, 1996), World Scientific Publishing, Singapore, 1997, pp. 259-278.","DOI":"10.1007\/3-540-61695-0_24"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB11","doi-asserted-by":"crossref","unstructured":"A. Deutsch, Interprocedural may-alias analysis for pointers: beyond k-limiting, Proceedings of the ACM SIGPLAN '94 Conference on Programming Languages Design and Implementation, Orlando, 1994, pp. 230\u2013241.","DOI":"10.1145\/178243.178263"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB12","doi-asserted-by":"crossref","unstructured":"M. Sagiv, T. Reps, R. Wilhelm, Solving shape-analysis problems in languages with destructive updating, SIGPLAN-SIGACT Symposium on Principles of Programming Languages, FL, 1996, pp. 16\u201331.","DOI":"10.1145\/237721.237725"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB13","doi-asserted-by":"crossref","unstructured":"W. Landi, B.G. Ryder, S. Zhang, Interprocedural modification side effect analysis with pointer aliasing, Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation, ACM SIGPLAN Notices 28 (1993) 56\u201367.","DOI":"10.1145\/173262.155096"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB14","unstructured":"J.R. Larus, P.N. Hilfinger, Detecting conflicts between structure accesses, Proceedings of the ACM SIGPLAN '88 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices 21 (1988) 21\u201334."},{"key":"10.1016\/S0167-8191(98)00023-4_BIB15","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1145\/322261.322272","article-title":"A unified approach to path problems","volume":"28","author":"Tarjan","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB16","doi-asserted-by":"crossref","unstructured":"K. Cooper, K. Kennedy, Fast interprocedural alias analysis, Proceedings of the 16th ACM Symposium Principles of Programming Languages, Austin, TX, 1989, pp. 49\u201359.","DOI":"10.1145\/75277.75282"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB17","unstructured":"W. Landi, Interprocedural aliasing in the presence of pointers, PhD thesis, The State University of New Jersey, Rutgers, 1992."},{"key":"10.1016\/S0167-8191(98)00023-4_BIB18","doi-asserted-by":"crossref","unstructured":"W. Landi, B.G. Ryder, A safe approximation algorithm for interprocedural pointer aliasing, Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, 1992, pp. 235\u2013248.","DOI":"10.1145\/143103.143137"},{"issue":"1","key":"10.1016\/S0167-8191(98)00023-4_BIB19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/71.80123","article-title":"Parallelizing programs with recursive data structures","volume":"1","author":"Hendren","year":"1990","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"10.1016\/S0167-8191(98)00023-4_BIB20","doi-asserted-by":"crossref","unstructured":"N. Jones, S. Muchnick, Flow analysis and optimization of Lisp-like structures, in: S. Muchnick, N. Jones (Eds.), Program Flow Analysis: Theory and Application, Prentice-Hall, Englewood Cliffs, NJ, 1979, pp. 102\u2013131.","DOI":"10.1145\/567752.567776"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB21","doi-asserted-by":"crossref","unstructured":"D.R. Chase, M. Wegman, F.K. Zadeck, Analysis of pointers and structures, Proceedings of the ACM SIGPLAN '90 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices 25 (1990) 296\u2013310.","DOI":"10.1145\/93548.93585"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s002360050037","article-title":"Alias analysis of pointers in Pascal and Fortran 90: dependence analysis between pointer references","volume":"33","author":"Matsumoto","year":"1996","journal-title":"Acta Informatica"},{"issue":"1","key":"10.1016\/S0167-8191(98)00023-4_BIB23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/52.251214","article-title":"Parallelizing subroutines in sequential programs","volume":"11","author":"Chu","year":"1994","journal-title":"IEEE Software"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB24","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321921.321938","article-title":"Global flow analysis and iterative algorithms","volume":"23","author":"Kam","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB25","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","article-title":"Monotone data flow analysis frameworks","volume":"7","author":"Kam","year":"1977","journal-title":"Acta Informatica"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB26","doi-asserted-by":"crossref","unstructured":"E.M. Myers, A precise interprocedural data flow algorithm, Conference Record of the 8th Annual ACM Symposium on Principles of Programming Languages, 1981, pp. 219\u2013230.","DOI":"10.1145\/567532.567556"},{"key":"10.1016\/S0167-8191(98)00023-4_BIB27","doi-asserted-by":"crossref","unstructured":"H.D. Pande, Compile time analysis of C and C++ systems, PhD thesis, Rutgers University, NJ, May 1996.","DOI":"10.1109\/ICPP.1996.538557"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198000234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198000234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T15:25:26Z","timestamp":1578497126000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819198000234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":27,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0167819198000234"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(98)00023-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}