{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T23:29:13Z","timestamp":1707521353802},"reference-count":51,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2003,11,26]],"date-time":"2003-11-26T00:00:00Z","timestamp":1069804800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[2004,1]]},"abstract":"Abstract<\/jats:title>Conditioned slicing is a source code extraction technique. The extraction is performed with respect to a slicing criterion which contains a set of variables and conditions of interest. Conditioned slicing removes the parts of the original program which cannot affect the variables at the point of interest, when the conditions are satisfied. This produces a conditioned slice, which preserves the behaviour of the original with respect to the slicing criterion.<\/jats:p>Conditioned slicing has applications in source code comprehension, reuse, restructuring and testing. Unfortunately, implementation is not straightforward because the full exploitation of conditions requires the combination of symbolic execution, theorem proving and traditional static slicing. Hitherto, this difficultly has hindered development of fully automated conditioning slicing tools.<\/jats:p>This paper describes the first fully automated conditioned slicing system, CON<\/jats:sc>SIT, detailing the theory that underlies it, its architecture and the way it combines symbolic execution, theorem proving and slicing technologies. The use of CON<\/jats:sc>SIT is illustrated with respect to the applications of testing and comprehension. Copyright \u00a9 2003 John Wiley & Sons, Ltd.<\/jats:p>","DOI":"10.1002\/spe.556","type":"journal-article","created":{"date-parts":[[2003,12,12]],"date-time":"2003-12-12T08:01:12Z","timestamp":1071216072000},"page":"15-46","source":"Crossref","is-referenced-by-count":21,"title":["CON<\/scp>SIT: a fully automated conditioned program slicer"],"prefix":"10.1002","volume":"34","author":[{"given":"Chris","family":"Fox","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Danicic","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Harman","sequence":"additional","affiliation":[]},{"given":"Robert M.","family":"Hierons","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2003,11,26]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"WeiserM.Program slices: Formal psychological and practical investigations of an automatic program abstraction method.PhD Thesis University of Michigan Ann Arbor MI 1979."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90054-3"},{"issue":"6","key":"e_1_2_1_5_2","article-title":"Dynamic program slicing","volume":"25","author":"Agrawal H","year":"1990","journal-title":"ACM SIGPLAN Conference on Programming Language Design and Implementation (SIGPLAN Notices)"},{"key":"e_1_2_1_6_2","first-page":"595","volume-title":"Information and Software Technology Special Issue on Program Slicing","author":"Canfora G","year":"1998"},{"key":"e_1_2_1_7_2","first-page":"647","volume-title":"Information and Software Technology Special Issue on Program Slicing","author":"Korel B","year":"1998"},{"issue":"3","key":"e_1_2_1_8_2","first-page":"121","article-title":"A survey of program slicing techniques","volume":"3","author":"Tip F","year":"1995","journal-title":"Journal of Programming Languages"},{"key":"e_1_2_1_9_2","first-page":"1","volume-title":"Advances of Computing","author":"Binkley DW","year":"1996"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2001.972675"},{"issue":"1","key":"e_1_2_1_11_2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/77606.77608","article-title":"Interprocedural slicing using dependence graphs","volume":"12","author":"Horwitz S","year":"1990","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00170-0"},{"key":"e_1_2_1_13_2","unstructured":"LyleJR WallaceDR GrahamJR GallagherKB PooleJP BinkleyDR.Unravel project.http:\/\/www.hissa.ncsl.nist.gov\/\u02dcjimmy\/unravel.html."},{"key":"e_1_2_1_14_2","unstructured":"HorwitzS RepsT.Wisconsin program slicing.http:\/\/www.cs.wisc.edu\/wpis\/html\/."},{"key":"e_1_2_1_15_2","first-page":"9","volume-title":"Proceedings 4th IEEE Workshop on Program Comprehension","author":"De Lucia A","year":"1996"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0031808"},{"key":"e_1_2_1_17_2","unstructured":"LevittJR.Formal verification techniques for digital systems.PhD Thesis Stanford University December1998."},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2000.883049"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/338407.338574"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1049\/sej.1988.0029"},{"key":"e_1_2_1_21_2","unstructured":"De LuciaA.Private communication.1996."},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1982.235572"},{"key":"e_1_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1985.231892"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1980.234486"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.232"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/390011.808263"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380230603"},{"key":"e_1_2_1_28_2","unstructured":"KamkarM.Interprocedural dynamic slicing with applications to debugging and testing.PhD Thesis Department of Computer Science and Information Science Link\u00f6ping University Sweden 1993. Available as Link\u00f6ping Studies in Science and Technology Dissertations Number 297."},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1994.336752"},{"key":"e_1_2_1_30_2","first-page":"379","volume-title":"Proceedings of the 22nd ACM Symposium on Principles of Programming Languages","author":"Field J","year":"1995"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1002\/swf.41"},{"issue":"5","key":"e_1_2_1_32_2","first-page":"721","article-title":"Partial evaluation of computation process\u2014an approach to a compiler","volume":"2","author":"Futamura Y","year":"1971","journal-title":"Systems, Computers, Controls"},{"key":"e_1_2_1_33_2","first-page":"391","volume-title":"On the Essence of Computation","author":"Ershov AP","year":"1978"},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61580-6_20"},{"key":"e_1_2_1_35_2","first-page":"133","volume-title":"IFIP TC2 Workshop on Partial Evaluation and Mixed Computation","author":"Futamura Y","year":"1987"},{"key":"e_1_2_1_36_2","first-page":"67","volume-title":"Report of a Conference on High Speed Automatic Calculating Machines","author":"Turing AM","year":"1949"},{"key":"e_1_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"e_1_2_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_2_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155095"},{"key":"e_1_2_1_40_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380230604"},{"key":"e_1_2_1_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/0164-1212(90)90063-R"},{"key":"e_1_2_1_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.341844"},{"key":"e_1_2_1_43_2","first-page":"74","volume-title":"Proceedings 13th International Conference on Automated Software Engineering","author":"Fischer B","year":"1998"},{"key":"e_1_2_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/186258.186523"},{"key":"e_1_2_1_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.92907"},{"key":"e_1_2_1_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00191-0"},{"key":"e_1_2_1_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.908957"},{"key":"e_1_2_1_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.1995.514706"},{"key":"e_1_2_1_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1995.526534"},{"key":"e_1_2_1_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/WPC.2001.921717"},{"key":"e_1_2_1_51_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1383-7621(01)00003-0"},{"key":"e_1_2_1_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2001.972724"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.556","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T20:11:58Z","timestamp":1700165518000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11,26]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["10.1002\/spe.556"],"URL":"http:\/\/dx.doi.org\/10.1002\/spe.556","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,11,26]]}}}
