{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:15:51Z","timestamp":1760573751284,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"13","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["10139223"],"award-info":[{"award-number":["10139223"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Software Technology"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0950-5849(00)00127-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:10:41Z","timestamp":1027591841000},"page":"935-946","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Analyzing dependence locality for efficient construction of program dependence graph"],"prefix":"10.1016","volume":"42","author":[{"given":"F.","family":"Ohata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Nishimatsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1986","series-title":"Compilers: Principles, Techniques, and Tools","author":"Aho","key":"10.1016\/S0950-5849(00)00127-0_BIB1"},{"key":"10.1016\/S0950-5849(00)00127-0_BIB2","doi-asserted-by":"crossref","unstructured":"D.C. Atkison, W.G. Griswold, The design of whole-program analysis tools, in: Proceedings of the 18th International Conference on Software Engineering, Berlin, Germany, 1996, pp. 16\u201327.","DOI":"10.1109\/ICSE.1996.493398"},{"key":"10.1016\/S0950-5849(00)00127-0_BIB3","doi-asserted-by":"crossref","unstructured":"J. Beck, D. Eichmann, Program and interface slicing for reverse engineering, in: Proceedings of the 15th International Conference on Software Engineering, 1993, pp. 509\u2013518.","DOI":"10.1109\/ICSE.1993.346015"},{"key":"10.1016\/S0950-5849(00)00127-0_BIB4","doi-asserted-by":"crossref","unstructured":"S. Bates, S. Horwitz, Incremental program testing using program dependence graphs, in: Conference Record of the 20th ACM Symposium on Principles of Programming Languages, 1993.","DOI":"10.1145\/158511.158694"},{"key":"10.1016\/S0950-5849(00)00127-0_BIB5","doi-asserted-by":"crossref","unstructured":"R. Fiutem, P. Tonella, G. Antoniol, E. Merlo, Variable precision reaching definitions analysis for software maintenance, in: Proceedings of the Euromicro Working Conference on Software Maintenance and Reengineering, Berlin, Germany, 1997, pp. 60\u201367.","DOI":"10.1109\/CSMR.1997.583007"},{"issue":"8","key":"10.1016\/S0950-5849(00)00127-0_BIB6","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1109\/32.83912","article-title":"Using program slicing in software maintenance","volume":"17","author":"Gallagher","year":"1991","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0950-5849(00)00127-0_BIB7","doi-asserted-by":"crossref","unstructured":"S. Horwitz, T. Reps, The use of program dependence graphs in software engineering, in: Proceedings of the 14th International Conference on Software Engineering, Melbourne, Australia, 1992, pp. 392\u2013411.","DOI":"10.1145\/143062.143156"},{"issue":"1","key":"10.1016\/S0950-5849(00)00127-0_BIB8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/77606.77608","article-title":"Interprocedural slicing using dependence graphs","volume":"12","author":"Horwitz","year":"1990","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0950-5849(00)00127-0_BIB9","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/S0950-5849(98)00089-5","article-title":"Dynamic program slicing methods","volume":"40","author":"Korel","year":"1998","journal-title":"Information and Software Technology (Special Issue on Program Slicing)"},{"key":"10.1016\/S0950-5849(00)00127-0_BIB10","doi-asserted-by":"crossref","unstructured":"H. Kudo, Y. Sugiyama, M. Fujii, K. Torii, Quantifying a design process based on experiments, in: Proceedings of the 21st International Conference on System Sciences, Hawaii, 1988, pp. 285\u2013292.","DOI":"10.1109\/HICSS.1988.11817"},{"key":"10.1016\/S0950-5849(00)00127-0_BIB11","unstructured":"K. Nishie, T. Kamiya, S. Kusumoto, K. Inoue, Experimental evaluation of usefulness of debugging support system based on program slicing, in: Proceedings of Software Symposium \u201997, Japan, 1997, pp. 142\u2013147 (in Japanese)."},{"key":"10.1016\/S0950-5849(00)00127-0_BIB12","unstructured":"A. Nishimatsu, S. Kusumoto, K. Inoue, An experimental evaluation of program slicing on fault localization process, Technical Report of IEICE, SS98-3, Japan, 1998, pp. 17\u201324 (in Japanese)."},{"key":"10.1016\/S0950-5849(00)00127-0_BIB13","unstructured":"A. Nishimatsu, K. Inoue, Proposal of a slicing algorithm and its efficiency and accuracy trade-off, Technical Report of IEICE, SS98-46, Japan, 1999, pp. 9\u201316 (in Japanese)."},{"key":"10.1016\/S0950-5849(00)00127-0_BIB14","doi-asserted-by":"crossref","unstructured":"A. Nishimatsu, M. Jihira, S. Kusumoto, K. Inoue, Call-mark slicing: an efficient and economical way of reducing slice, in: Proceedings of the 21st International Conference on Software Engineering, Los Angeles, CA, USA, 1999, pp. 422\u2013431.","DOI":"10.1145\/302405.302674"},{"key":"10.1016\/S0950-5849(00)00127-0_BIB15","unstructured":"S. Sato, H. Iida, K. Inoue, Software debug supporting tool based on program dependence analysis, in: Transaction on IPSJ, Japan, 1996, vol. 37, no. 4, pp. 536\u2013545."},{"key":"10.1016\/S0950-5849(00)00127-0_BIB16","unstructured":"T. Takada, S. Sato, K. Inoue, Incremental update method of program dependence graph, in: Technical Report of IEICE, SS96-54, Japan, 1996, pp. 49\u201356 (in Japanese)."},{"key":"10.1016\/S0950-5849(00)00127-0_BIB17","unstructured":"R. Ueda, K. Inoue, H. Iida, A practical slice algorithm for recursive programs, in: Proceedings of the International Symposium on Software Engineering for the Next Generation, Nagoya, Japan, 1996, pp. 96\u2013106."},{"key":"10.1016\/S0950-5849(00)00127-0_BIB18","unstructured":"M. Weiser, Program slicing, in: Proceedings of the Fifth International Conference on Software Engineering, San Diego, CA, 1981, pp. 439\u2013449."},{"key":"10.1016\/S0950-5849(00)00127-0_BIB19","unstructured":"The Wisconsin Program-Slicing Tool 1.0, Reference Manual. Computer Sciences Department, University of Wisconsin-Madison, 1997."}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584900001270?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584900001270?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:08:43Z","timestamp":1760504923000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950584900001270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":19,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0950584900001270"],"URL":"https:\/\/doi.org\/10.1016\/s0950-5849(00)00127-0","relation":{},"ISSN":["0950-5849"],"issn-type":[{"type":"print","value":"0950-5849"}],"subject":[],"published":{"date-parts":[[2000,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Analyzing dependence locality for efficient construction of program dependence graph","name":"articletitle","label":"Article Title"},{"value":"Information and Software Technology","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0950-5849(00)00127-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}