{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:32:59Z","timestamp":1729618379811,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/scam.2005.18","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:41:15Z","timestamp":1160581275000},"page":"45-56","source":"Crossref","is-referenced-by-count":1,"title":["Minimal Slicing and the Relationships Between Forms of Slicing"],"prefix":"10.1109","author":[{"given":"D.","family":"Binkley","sequence":"first","affiliation":[]},{"given":"S.","family":"Danicic","sequence":"additional","affiliation":[]},{"given":"T.","family":"Gyimothy","sequence":"additional","affiliation":[]},{"given":"M.","family":"Harman","sequence":"additional","affiliation":[]},{"given":"A.","family":"Kiss","sequence":"additional","affiliation":[]},{"given":"B.","family":"Korel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01213536"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/WPC.1997.601266"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1023\/B:AUSE.0000008667.37988.11"},{"key":"15","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1025872819613","article-title":"Non-standard semantics for program slicing","volume":"16","author":"giacobazzi","year":"2003","journal-title":"Higher-Order and Symbolic Computation"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(02)00135-8"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2001.972675"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/32.83912"},{"key":"11","article-title":"Slicing algorithms are minimal for programs which can be expressed as linear, free, liberal schemas","author":"danicic","year":"0","journal-title":"The Computer Journal"},{"key":"12","article-title":"A lazy semantics for program slicing","author":"danicic","year":"2004","journal-title":"1st International Workshop on Programming Language Interference and Dependence Verona"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/77606.77608"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/73141.74821"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90054-3"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00374-2"},{"key":"24","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","article-title":"Program analysis via graph reachability","volume":"40","author":"reps","year":"1998","journal-title":"Information and Software Technology special issue on program slicing"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/193173.195287"},{"key":"26","article-title":"The semantics of program slicing","volume":"777","author":"reps","year":"1988","journal-title":"Technical Report Technical Report"},{"key":"27","first-page":"121","article-title":"A survey of program slicing techniques","volume":"3","author":"tip","year":"1995","journal-title":"Journal of Programming Languages"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113455"},{"key":"29","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/113446.113455","volume":"26","year":"1991","journal-title":"SIGPlan Notices"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2004.13"},{"journal-title":"Multi-procedure Program Integration","year":"1991","author":"binkley","key":"2"},{"journal-title":"Dataflow Minimal Slicing","year":"1999","author":"danicic","key":"10"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93576"},{"journal-title":"Program Slices Formal Psychological and Practical Investigations of an Automatic Program Abstraction Method","year":"1979","author":"weiser","key":"30"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(98)00086-X"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(03)62003-6"},{"key":"5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0065-2458(08)60641-5","article-title":"Program slicing","volume":"43","author":"binkley","year":"1996","journal-title":"Advances in Computing Volume 43"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/176454.176473"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.4.511"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/73141.74820"}],"event":{"name":"Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)","location":"Budapest, Hungary"},"container-title":["Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10344\/32907\/01541157.pdf?arnumber=1541157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T10:08:28Z","timestamp":1497694108000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1541157\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/scam.2005.18","relation":{},"subject":[]}}