{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:11:03Z","timestamp":1759032663043,"version":"3.41.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T00:00:00Z","timestamp":1609372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"KK-stiftelsen finansierar","award":["16492 HERO"],"award-info":[{"award-number":["16492 HERO"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2020,12,31]]},"abstract":"<jats:p>Existing proofs of correctness for dependence-based slicing methods are limited either to the slicing of intraprocedural programs [2, 39], or the proof is only applicable to a specific slicing method [4, 41]. We contribute a general proof of correctness for dependence-based slicing methods such as Weiser [50, 51], or Binkley et\u00a0al. [7, 8], for interprocedural, possibly nonterminating programs. The proof uses well-formed weak and strong control closure relations, which are the interprocedural extensions of the generalised weak\/strong control closure provided by Danicic et al. [13], capturing various nonterminating-insensitive and nontermination-sensitive control-dependence relations that have been proposed in the literature. Thus, our proof framework is valid for a whole range of existing control-dependence relations.<\/jats:p>\n          <jats:p>We have provided a definition of semantically correct (SC) slice. We prove that SC slices agree with Weiser slicing, that deterministic SC slices preserve termination, and that nondeterministic SC slices preserve the nondeterministic behavior of the original programs.<\/jats:p>","DOI":"10.1145\/3434489","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T14:30:25Z","timestamp":1609770625000},"page":"1-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs"],"prefix":"10.1145","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4872-1208","authenticated-orcid":false,"given":"Abu Naser","family":"Masud","sequence":"first","affiliation":[{"name":"M\u00e4lardalen University, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5297-6548","authenticated-orcid":false,"given":"Bj\u00f6rn","family":"Lisper","sequence":"additional","affiliation":[{"name":"M\u00e4lardalen University, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/966049.777394"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.10.002"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019410"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.10.025"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/176454.176473"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.04.007"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.01.012"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60641-5"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/73141.74820"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","unstructured":"A. Chaturvedi and D. Binkley. 2018. Web service slicing: Intra and inter-operational analysis to test changes. IEEE Trans. Serv. Comput. (2018) 1--1. DOI:https:\/\/doi.org\/10.1109\/TSC.2018.2821157","DOI":"10.1109\/TSC.2018.2821157"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.08.033"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2007.02.010"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/314403.314470"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025872819613"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90038-4"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/647168.718134"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.53994"},{"volume-title":"Proceedings of the 12th Annual International Computer Software and Applications Conference (COMPSAC\u201988)","author":"Hawang C. R.","key":"e_1_2_1_21_1","unstructured":"C. R. Chou J. C. Hawang, and M. W. Du. 1988. Finding program slices for recursive procedures. In Proceedings of the 12th Annual International Computer Software and Applications Conference (COMPSAC\u201988). Chicago, 220--227."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/193173.195281"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602576.2602589"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 5th International Valentin Turchin Workshop on Metacomputation.","author":"Khanfar Husni","year":"2016","unstructured":"Husni Khanfar and Bj\u00f6rn Lisper. 2016. Enhanced PCB based slicing. In Proceedings of the 5th International Valentin Turchin Workshop on Metacomputation."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19584-1_4"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2678015.2682538"},{"volume-title":"Proceedings of the Conference on Software Maintenance. 282--291","author":"Loyall J. P.","key":"e_1_2_1_27_1","unstructured":"J. P. Loyall and S. A. Mathisen. 1993. Using dependence analysis to support the software maintenance process. In Proceedings of the Conference on Software Maintenance. 282--291."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SOCA.2009.5410460"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.869"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3029052"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.3176\/eng.2005.4.05"},{"volume-title":"Semantics with Applications: An Appetizer (Undergraduate Topics in Computer Science)","author":"Nielson Hanne Riis","key":"e_1_2_1_33_1","unstructured":"Hanne Riis Nielson and Flemming Nielson. 2007. Semantics with Applications: An Appetizer (Undergraduate Topics in Computer Science). Springer-Verlag, Secaucus, NJ."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/390010.808263"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/256167.256217"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.58784"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460299.1460314"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the European Symposium on Programming (LNCS\u201905)","volume":"3444","author":"Ranganath Venkatesh Prasad","unstructured":"Venkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee, John Hatcliff, and Matthew B. Dwyer. 2005. A new foundation for control dependence and slicing for modern program structures. In Proceedings of the European Symposium on Programming (LNCS\u201905), Vol. 3444. Springer-Verlag, 77--93."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275497.1275502"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"volume-title":"Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT\u201989)","author":"Thomas","key":"e_1_2_1_41_1","unstructured":"Thomas W. Reps and Wuu Yang. 1989. The semantics of program slicing and program integration. In Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT\u201989), Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages (CCIPL\u201989) (Lecture Notes in Computer Science). Springer, 360--374."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2005.2"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187671.2187674"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/367008.367022"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1216374.1216375"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2001.972680"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2003.1238035"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1002\/smr.1803"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/800078.802557"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"key":"e_1_2_1_51_1","unstructured":"Mark David Weiser. 1979. Program Slices: Formal Psychological and Practical Investigations of an Automatic Program Abstraction Method. Ph.D. Dissertation. Ann Arbor MI."}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434489","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3434489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:48Z","timestamp":1750195908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,31]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12,31]]}},"alternative-id":["10.1145\/3434489"],"URL":"https:\/\/doi.org\/10.1145\/3434489","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"type":"print","value":"0164-0925"},{"type":"electronic","value":"1558-4593"}],"subject":[],"published":{"date-parts":[[2020,12,31]]},"assertion":[{"value":"2017-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}