Please use this identifier to cite or link to this item:
|Title:||The effectiveness of refactoring, based on a compatibility testing taxonomy and a dependency graph|
|Citation:||IEEE Testing: Academia & Industry Conference - Practice And Research Techniques (TAIC-PART 2006), Windsor, August 2006. pp. 181-190|
|Abstract:||In this paper, we describe and then appraise a testing taxonomy proposed by van Deursen and Moonen (VD&M) based on the post-refactoring repeatability of tests. Four categories of refactoring are identified by VD&M ranging from semantic-preserving to incompatible, where, for the former, no new tests are required and for the latter, a completely new test set has to be developed. In our appraisal of the taxonomy, we heavily stress the need for the inter-dependence of the refactoring categories to be considered when making refactoring decisions and we base that need on a refactoring dependency graph developed as part of the research. We demonstrate that while incompatible refactorings may be harmful and time-consuming from a testing perspective, semantic-preserving refactorings can have equally unpleasant hidden ramifications despite their advantages. In fact, refactorings which fall into neither category have the most interesting properties. We support our results with empirical refactoring data drawn from seven Java open-source systems (OSS) and from the same analysis form a tentative categorization of code smells.|
|Appears in Collections:||Computer Science|
Dept of Computer Science Research Papers
Software Engineering (B-SERC)
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.