期刊文献+

基于版本的多重软件重构自动检测技术研究 被引量:2

The Study on the Automatic Detection of Multi-Software Refactoring Based on Version
下载PDF
导出
摘要 软件重构的自动检测是目前软件重构领域的一个研究热点.目前,多重软件重构的自动检测方法能够检测出在不同软件版本的不同位置上实施的多重重构操作,但是对发生在不同软件版本的相同位置上的多重重构操作则无能为力.为此,该文提出了一种在函数级别,利用函数调用图,实现基于多版本的多重软件重构的自动检测方法.该方法能够自动检测出在不同软件版本中的同一个函数上发生的"函数抽取"和"函数重命名"多重重构操作.同时,通过实验验证了该方法的有效性. Automatic detection of software refactoring is one of hot topics in the field of software refactoring.The current technology of automatic detection of software refactoring can detect multi-software refactoring happened at different locations in different software versions and is short of the ability to detect it at the same location in different software versions.In the paper,an automatic detection technology based on call graph is proposed at the level of method,which can automatically detect themulti-software refactoring including"extract method"and"rename method"in the same function in different software versions.Also,the effectiveness of the proposed technology is realized by the experiments.
作者 钟林辉 黄小明 薛良波 叶海涛 ZHONG Linhui;HUANG Xiaoming;XUE Liangbo;YE Haitao(College of Computer and Information Engineering,Jiangxi Normal University,Nanchang Jiangxi 330022,China)
出处 《江西师范大学学报(自然科学版)》 CAS 北大核心 2018年第5期464-469,472,共7页 Journal of Jiangxi Normal University(Natural Science Edition)
基金 国家自然科学基金(61462040 61662032 61262015 61762049) 江西省自然科学基金(20142BAB207027 20171BAB202013) 江西省教育厅科学技术(GJJ170207)资助项目
关键词 软件重构 软件版本 函数抽取 函数重命名 software refactoring software version extract method rename method
  • 相关文献

参考文献2

二级参考文献15

  • 1Yazdani N,Ozsoyoglu Z M.Sequence matching of images[C]//Proceedings of the IEEE International Conference on Multimedia Computing and Systems,Volume Ⅱ, 1996:53-62.
  • 2Hunt J W,Szymanski T G.A fast algorithm for computing longest common subsequences[J].Communications of the ACM, 1977,20(5): 350-353.
  • 3Sutinen E,Tarhio J.Approximate string matching with ordered qgrams[J].Nordic Journal of Computing, 2004, 11 (4) : 321-343.
  • 4Setubal,Meidanis J.Introduction to computation molecular biology. University of Campinas,Brazil, 1997.
  • 5Apostolico,Guerra C.The Longest Common Subsequenee problem revisited[J].Algorithmica, 1987(2 ) : 315-336.
  • 6Deken.Some limit results for longest common subsequences[J].Discrete Mathematics, 1979,26:17-31.
  • 7Gusfield.Algorithms on strings,trees,and sequences:computer science and computational biology[D].Cambridge:Cambridge University Press, 1997.
  • 8Keceeioglu,Sankoff D.Exact and approximation algorithms for the inversion distance between two permutations[J].Algorithmica,1995, 13: 180-210.
  • 9Mens T,Tourwe T. A survey of software refactoring [J]. IEEE Transactions on Software Engineering, 2004,30 (2) : 126-139.
  • 10Opdyke W F. Refactoring object-oriented frameworks[D]. Llli- nois: University of Illinois at Urbana-Champaign, 1992.

共引文献20

同被引文献6

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部