首页> 外文会议>IEEE International Conference on Software Maintenance >Template-based reconstruction of complex refactorings
【24h】

Template-based reconstruction of complex refactorings

机译:基于模板的复合重构重构

获取原文
获取外文期刊封面目录资料

摘要

Knowing which types of refactoring occurred between two program versions can help programmers better understand code changes. Our survey of refactoring identification techniques found that existing techniques cannot easily identify complex refactorings, such as an replace conditional with polymorphism refactoring, which consist of a set of atomic refactorings. This paper presents REF-FINDER that identifies complex refactorings between two program versions using a template-based refactoring reconstruction approach—REF-FINDER expresses each refactoring type in terms of template logic rules and uses a logic programming engine to infer concrete refactoring instances. It currently supports sixty three refactoring types from Fowler's catalog, showing the most comprehensive coverage among existing techniques. The evaluation using code examples from Fowler's catalog and open source project histories shows that REF-FINDER identifies refactorings with an overall precision of 0.79 and recall of 0.95.
机译:了解两个程序版本之间发生了哪些类型的重构可以帮助程序员更好地了解代码更改。我们对重构识别技术的调查发现现有技术不能轻易识别复杂的重构,例如用多态性重构的替换条件,其由一组原子重构组成。本文介绍了使用基于模板的重构重建方法-Cref-Finder在模板逻辑规则方面表达了每个重构类型的两个程序版本之间的复杂重构,并使用逻辑编程引擎来推断具体的重构实例。它目前支持来自Fowler的目录的六十三种重构类型,显示现有技术中最全面的覆盖范围。使用来自Fowler的目录和开源项目历史的代码示例的评估显示,REF-Finder识别重构,整体精度为0.79并召回0.95。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号