{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T17:07:31Z","timestamp":1747933651403,"version":"3.28.0"},"reference-count":45,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/scam.2002.1134105","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T21:03:42Z","timestamp":1056575022000},"page":"55-64","source":"Crossref","is-referenced-by-count":15,"title":["VADA: a transformation-based system for variable dependence analysis"],"prefix":"10.1109","author":[{"given":"M.","family":"Harman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Fox","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Hierons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Lin Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Danicic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Wegener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","DOI":"10.1093\/comjnl\/37.9.795","article-title":"Reverse engineering through formal transformation","volume":"37","author":"ward","year":"1994","journal-title":"The Computer Journal"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/113445.113455"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1689(199912)9:4<263::AID-STVR190>3.0.CO;2-Y"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/RTTAS.1998.683198"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/32.988709"},{"key":"ref30","article-title":"Equivalence of conservative, linear, free program schemas is decidable","author":"laurence","year":"0","journal-title":"Theoretical Computer Science to appear"},{"key":"ref37","first-page":"169","article-title":"The way forward for unifying dynamic test-case generation: The optimisation-based approach","author":"tracey","year":"1998","journal-title":"International Workshop on Dependable Computing and Its Applications (DCIA)"},{"key":"ref36","first-page":"121","article-title":"A survey of program slicing techniques","volume":"3","author":"tip","year":"1995","journal-title":"Journal of Programming Languages"},{"journal-title":"Denotational Semantics The Scott-Strachey Approach to Programming Language Theory","year":"1985","author":"stoy","key":"ref35"},{"key":"ref34","first-page":"305","author":"partsch","year":"1984","journal-title":"The CIP Transformation System"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2000.883049"},{"key":"ref40","first-page":"185","article-title":"The formal approach to source code analysis and manipulation","author":"ward","year":"2001","journal-title":"1st IEEE International Workshop on Source Code Analysis and Manipulation (Florence Italy"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00170-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263742"},{"key":"ref13","first-page":"44","article-title":"A tranformation system for developing recursive programs","volume":"1","author":"darlington","year":"1977","journal-title":"J ACM 24"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2001.972675"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512964"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/357153.357154"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/226155.226158"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199534"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/WPC.1997.601266"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.1993.346057"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1998.738516"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90054-3"},{"key":"ref3","article-title":"Transformation systems: Domain-oriented component and implementation knowledge","author":"baxter","year":"1999","journal-title":"Proceedings of the Ninth Workshop on Institutionalizing Software Reuse"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60641-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/365230.365257"},{"key":"ref5","first-page":"519","article-title":"Computing amorphous program slices using dependence graphs and a data-flow model","author":"binkley","year":"1999","journal-title":"ACM Symposium on Applied Computing (The Menger San Antonio Texas U S A"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/565816.503290"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(98)00086-X"},{"journal-title":"Compilers Principles Techniques and Tools","year":"1986","author":"aho","key":"ref2"},{"journal-title":"Dataflow Minimal Slicing","year":"1999","author":"danicic","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93576"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/swf.41"},{"journal-title":"Program Schemas with Semantic Restrictions","year":"1977","author":"weyuker","key":"ref45"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/WPC.2001.921741"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2001.972724"},{"key":"ref42","first-page":"841","article-title":"Evolutionary test environment for automatic structural testing","volume":"14","author":"wegener","year":"2001","journal-title":"Information and Software Technology Special Issue on Software Engineering using Metaheuristic Innovative Algorithms 43"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/77606.77608"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1989.65225"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.1998.671104"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1049\/sej.1996.0040","article-title":"automatic structural testing using genetic algorithms","volume":"11","author":"jones","year":"1996","journal-title":"Software Engineering Journal"},{"journal-title":"Program Slices Formal Psychological and Practical Investigations of an Automatic Program Abstraction Method","year":"1979","author":"weiser","key":"ref43"},{"key":"ref25","article-title":"Chopping: A generalisation of slicing","author":"jackson","year":"1994","journal-title":"Tech Rep CMU-CS-94-169 School of Computer Science Carnegie Mellon University Pittsburgh PA"}],"event":{"name":"Second IEEE International Workshop on Source Code Analysis and Manipulation","acronym":"SCAM-02","location":"Montreal, Que., Canada"},"container-title":["Proceedings. Second IEEE International Workshop on Source Code Analysis and Manipulation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8211\/25179\/01134105.pdf?arnumber=1134105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:45:10Z","timestamp":1497552310000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1134105\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/scam.2002.1134105","relation":{},"subject":[]}}