Predicting complexity of refactoring within refactoring application contexts적용 상황에서의 코드 리팩토링의 복잡도 예측

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 392
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorChoi, Ho-Jin-
dc.contributor.advisor최호진-
dc.contributor.authorGim, Jong-Gun-
dc.contributor.author김종근-
dc.date.accessioned2011-12-30-
dc.date.available2011-12-30-
dc.date.issued2006-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392614&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/55434-
dc.description학위논문(석사) - 한국정보통신대학교 : 공학부, 2006, [ viii, 55 p. ]-
dc.description.abstractThis thesis studies the effects of refactoring techniques in relation to aspects of software maintainability through well-defined metrics for objective assessment, and the contexts in which these effects differ. We studied a widely used refactoring technique, ``Extract Method`` of its effects on complexity. With respect to the technique we did the following: First, we proposed to use WMC (Weighted Methods per Class) for measuring complexity of individual method and RFC (Requests For a Class) for measuring complexity of interaction among methods. Then we proposed methods to predict WMC and RFC based on the attributes of code redundancy - the number of duplication, the complexity in the duplicated code and the redundancy scope (within a method, inter-methods, inter-class). We predicted the WMC variation with an application of ``Extract Method`` would be proportional to the number of redundancy and to the complexity of the redundant code. We also predicted RFC variation with an application of ``Extract Method`` would be 1 in the method scope duplication, and will be equal to redundancy count in inter-method scope redundancy. With ten cases in four java-based systems, we verified these predictions were correct.eng
dc.languageeng-
dc.publisher한국정보통신대학교-
dc.subjectRefactoring-
dc.subjectComplexity-
dc.subject복잡도-
dc.subject리팩토링-
dc.titlePredicting complexity of refactoring within refactoring application contexts-
dc.title.alternative적용 상황에서의 코드 리팩토링의 복잡도 예측-
dc.typeThesis(Master)-
dc.identifier.CNRN392614/225023-
dc.description.department한국정보통신대학교 : 공학부, -
dc.identifier.uid020044632-
dc.contributor.localauthorChoi, Ho-Jin-
dc.contributor.localauthor최호진-
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0