{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T06:50:02Z","timestamp":1778914202805,"version":"3.51.4"},"reference-count":31,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. ^|^ Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2014edp7310","type":"journal-article","created":{"date-parts":[[2015,1,5]],"date-time":"2015-01-05T07:24:49Z","timestamp":1420442689000},"page":"119-130","source":"Crossref","is-referenced-by-count":3,"title":["Comparison of Backward Slicing Techniques for Java"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Yu","family":"KASHIMA","sequence":"first","affiliation":[{"name":"Graduate School of Information Science and Technology, Osaka University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"ISHIO","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Osaka University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuro","family":"INOUE","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, Osaka University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Weiser, \u201cProgram slicing,\u201d IEEE Trans. Softw. Eng., vol.SE-10, no.4, pp.352-357, July 1984.","DOI":"10.1109\/TSE.1984.5010248"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] S. Kusumoto, A. Nishimatsu, K. Nishie, and K. Inoue, \u201cExperimental evaluation of program slicing for fault localization,\u201d Empirical Softw. Eng., vol.7, no.1, pp.49-76, March 2002.","DOI":"10.1023\/A:1014823126938"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] C. Hammer and G. Snelting, \u201cFlow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs,\u201d Int. J. Inf. Secur., vol.8, no.6, pp.399-422, Oct. 2009.","DOI":"10.1007\/s10207-009-0086-1"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] M. Acharya and B. Robinson, \u201cPractical change impact analysis based on static program slicing for industrial software systems,\u201d Proc. ICSE, pp.746-755, 2011.","DOI":"10.1145\/1985793.1985898"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] S. Horwitz, T. Reps, and D. Binkley, \u201cInterprocedural slicing using dependence graphs,\u201d Proc. PLDI, pp.35-46, 1988.","DOI":"10.1145\/960116.53994"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S. Danicic, C. Fox, M. Harman, R. Hierons, J. Howroyd, and M.R. Laurence, \u201cStatic program slicing algorithms are minimal for free liberal program schemas,\u201d Comput. J., vol.48, no.6, pp.737-748, Nov. 2005.","DOI":"10.1093\/comjnl\/bxh121"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Allen and S. Horwitz, \u201cSlicing java programs that throw and catch exceptions,\u201d Proc. PEPM, pp.44-54, 2003.","DOI":"10.1145\/966049.777394"},{"key":"8","unstructured":"[8] N. Walkinshaw, M. Roper, M. Wood, and N.W.M. Roper, \u201cThe java system dependence graph,\u201d Proc. SCAM, p.5, 2003."},{"key":"9","unstructured":"[9] D. Liang and M.J. Harrold, \u201cSlicing objects using system dependence graphs,\u201d Proc. ICSM, pp.358-367, 1998."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] L. Larsen and M.J. Harrold, \u201cSlicing object-oriented software,\u201d Proc. ICSE, pp.495-505, 1996.","DOI":"10.1109\/ICSE.1996.493444"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] C. Hammer and G. Snelting, \u201cAn improved slicer for java,\u201d Proc. PASTE, pp.17-22, 2004.","DOI":"10.1145\/996821.996830"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] B. Steensgaard, \u201cPoints-to analysis in almost linear time,\u201d Proc. POPL, pp.32-41, 1996.","DOI":"10.1145\/237721.237727"},{"key":"13","unstructured":"[13] L.O. Andersen, Program Analysis and Specialization for the C Programming Language, Ph.D. thesis, Department of Computer Science, University of Copenhagen, May 1994."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] A. Milanova, A. Rountev, and B.G. Ryder, \u201cParameterized object sensitivity for points-to analysis for java,\u201d ACM Trans. Softw. Eng. Methodol., vol.14, no.1, pp.1-41, Jan. 2005.","DOI":"10.1145\/1044834.1044835"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] G. Kastrinis and Y. Smaragdakis, \u201cHybrid context-sensitivity for points-to analysis,\u201d Proc. PLDI, pp.423-434, 2013.","DOI":"10.1145\/2499370.2462191"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] J. J\u00e1sz, A. Beszedes, T. Gyimothy, and V. Rajlich, \u201cStatic execute after\/before as a replacement of traditional software dependencies,\u201d Proc. ICSM, pp.137-146, Sept 2008.","DOI":"10.1109\/ICSM.2008.4658062"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] A. Beszedes, T. Gergely, J. Jasz, G. Toth, T. Gyimothy, and V. Rajlich, \u201cComputation of static execute after relation with applications to software maintenance,\u201d Proc. ICSM, pp.295-304, Oct. 2007.","DOI":"10.1109\/ICSM.2007.4362642"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] L.A. Meyerovich and A.S. Rabkin, \u201cEmpirical analysis of programming language adoption,\u201d Proc. OOPSLA, pp.1-18, 2013.","DOI":"10.1145\/2544173.2509515"},{"key":"19","unstructured":"[19] iTR co. Inc., \u201cPress release,\u201d http:\/\/www.itr.co.jp\/company_outline\/press_release\/130919PR\/index.html"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] D. Binkley, N. Gold, and M. Harman, \u201cAn empirical study of static program slice size,\u201d ACM Trans. Softw. Eng. Methodol., vol.16, no.2, pp.1-32, April 2007.","DOI":"10.1145\/1217295.1217297"},{"key":"21","unstructured":"[21] \u201cHomepage of grammatech's codesurfer.\u201d http:\/\/www.grammatech.com\/research\/technologies\/codesurfer"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] S.M. Blackburn, R. Garner, C. Hoffmann, A.M. Khang, K.S. McKinley, R. Bentzur, A. Diwan, D. Feinberg, D. Frampton, S.Z. Guyer, M. Hirzel, A. Hosking, M. Jump, H. Lee, J.E.B. Moss, A. Phansalkar, D. Stefanovic, T. VanDrunen, D. von Dincklage, and B. Wiedermann, \u201cThe dacapo benchmarks: Java benchmarking development and analysis,\u201d Proc. OOPSLA, pp.169-190, 2006.","DOI":"10.1145\/1167515.1167488"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] T. Reps, S. Horwitz, M. Sagiv, and G. Rosay, \u201cSpeeding up slicing,\u201d Proc. FSE, pp.11-20, 1994.","DOI":"10.1145\/195274.195287"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] O. Lhot\u00e1k and L. Hendren, \u201cScaling java points-to analysis using spark,\u201d Proc. CC, pp.153-169, 2003.","DOI":"10.1007\/3-540-36579-6_12"},{"key":"25","unstructured":"[25] R. Vall\u00e9e-Rai, P. Co, E. Gagnon, L. Hendren, P. Lam, and V. Sundaresan, \u201cSoot-a java bytecode optimization framework,\u201d Proc. CASCON, pp.125-135, IBM Press, 1999."},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] E. Ruf, \u201cContext-insensitive alias analysis reconsidered,\u201d Proc. PLDI, pp.13-22, 1995.","DOI":"10.1145\/223428.207112"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] E. Bodden, A. Sewe, J. Sinschek, H. Oueslati, and M. Mezini, \u201cTaming reflection: Aiding static analysis in the presence of reflection and custom class loaders,\u201d Proc. ICSE, pp.241-250, 2011.","DOI":"10.1145\/1985793.1985827"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] J. J\u00e1sz, L. Schrettner, A. Beszedes, C. Osztrogon\u00e1c, and T. Gyimothy, \u201cImpact analysis using static execute after in webkit,\u201d Proc. CSMR, pp.95-104, 2012.","DOI":"10.1109\/CSMR.2012.20"},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] D. Binkley and M. Harman, \u201cLocating dependence clusters and dependence pollution,\u201d Proc. ICSM, pp.177-186, 2005.","DOI":"10.1109\/ICSM.2005.58"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] C. Parnin and S. Rugaber, \u201cResumption strategies for interrupted programming tasks,\u201d Software Quality Control, vol.19, no.1, pp.5-34, March 2011.","DOI":"10.1007\/s11219-010-9104-9"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] D. Binkley, M. Harman, and J. Krinke, \u201cEmpirical study of optimization techniques for massive slicing,\u201d ACM Trans. Program. Lang. Syst., vol.30, no.1, Article no.3, Nov. 2007.","DOI":"10.1145\/1290520.1290523"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/1\/E98.D_2014EDP7310\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T22:18:03Z","timestamp":1747347483000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/1\/E98.D_2014EDP7310\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014edp7310","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}