{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,8]],"date-time":"2023-10-08T13:49:29Z","timestamp":1696772969363},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1996,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Program slicing is a technique by which statements are deleted from a program in such a way as to preserve a projection of the original program's semantics. It is shown that slicing algorithms based upon traditional defined and referenced variable sets do not preserve a projection of strict semantics with respect to computations which cause errors. Rather, these approaches preserve a projection of the program's semantics which is lazy with respect to errors. A modified version of defined and referenced variable sets is introduced, which provides the freedom to choose the form of semantics to be preserved.<\/jats:p>","DOI":"10.1007\/bf01213536","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:54:18Z","timestamp":1108742058000},"page":"490-497","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Slicing programs in the presence of errors"],"prefix":"10.1145","volume":"8","author":[{"given":"Mark","family":"Harman","sequence":"first","affiliation":[{"name":"School of Computing, University of North London, Holloway Road, N7 8DB, London, UK"}]},{"given":"Dan","family":"Simpson","sequence":"additional","affiliation":[{"name":"Department of Computing, University of Brighton, Moulsecoomb, Brighton, UK"}]},{"given":"Sebastian","family":"Danicic","sequence":"additional","affiliation":[{"name":"School of Computing, University of North London, Holloway Road, N7 8DB, London, UK"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","unstructured":"Aho A. V. Sethi R. and Ullman J. D.: Compilers: Principles techniques and tools . Addison Wesley 1986."},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.310673"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"crossref","unstructured":"Cartwright R. and Felleisen M.: The semantics of program dependence. In ACM SIGPLAN Conference on Programming Language Design and Implementation pages 13\u201327 1989.","DOI":"10.1145\/74818.74820"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.83912"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"crossref","unstructured":"Harman M. and Danicic S.: Using program slicing to simplify testing. Journal of Software Testing Verification and Reliability 1995. To appear.","DOI":"10.1002\/stvr.4370050303"},{"key":"e_1_2_1_2_7_2","unstructured":"Harman M. Danicic S. Sivagurunathan B. Jones B. and Sivagurunathan Y.: Cohesion metrics. In 8 th International Quality Week pages Paper 3-T-2 pp 1\u201314 San Francisco May 29th \u2013 June 2nd. 1995."},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/65979.65980"},{"key":"e_1_2_1_2_9_2","volume-title":"PhD Thesis","author":"Kamkar M.","year":"1993"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90054-3"},{"key":"e_1_2_1_2_11_2","unstructured":"Lakhotia A.: Rule-based approach to computing module cohesion. In Proceedings of the 15 th Conference on Software Engineering (ICSE-15) pages 34\u201344 1993."},{"key":"e_1_2_1_2_12_2","volume-title":"Technical report","author":"Liu L.","year":"1993"},{"key":"e_1_2_1_2_13_2","unstructured":"Lyle J. R. and Weiser M.: Automatic program bug location by program slicing. In 2nd International Conference on Computers and Applications pages 877\u2013882 Peking 1987."},{"key":"e_1_2_1_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/174245.174252"},{"key":"e_1_2_1_2_15_2","volume-title":"PhD thesis","author":"Tip F.","year":"1995"},{"issue":"6","key":"e_1_2_1_2_16_2","first-page":"26","article-title":"A survey of program slicing techniques","volume":"26","author":"Tip F.","year":"1995","journal-title":"Proceedings inSIGPLAN Notices"},{"key":"e_1_2_1_2_17_2","volume-title":"PhD thesis","author":"Weiser M.","year":"1979"},{"key":"e_1_2_1_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01213536.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01213536\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01213536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:27:21Z","timestamp":1641482841000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01213536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["10.1007\/BF01213536"],"URL":"https:\/\/doi.org\/10.1007\/bf01213536","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}