参考文献/References:
[1] Fowler M,Beck K,Brant J,et al.Roberts,refactoring: improving the design of existingcode[M].New Jersey:Addison-Wesley,1999.
[2] Dig D,Comertoglu C,Marinov D,et al.Automateddetection of refactorings in evolving components[C].Berlin:Springer Berlin Heidelberg,2006:404-428.
[3] Soares G,Gheyi R,Murphyhill E,et al.Comparing approaches to analyze refactoring activity on software repositories[J].Journal of Systems and Software,2013,86(4):1006-1022.
[4] 刘阳,刘秋荣,刘辉.函数抽取重构的自动检测方法[J].计算机科学,2015,42(12):105-107.
[5] Fontana F A,Braione P,Zanoni M.Automatic detection of bad smells in code:an experimental assessment[J].Journal of Object Technology,2012,11(2):1-38.
[6] Weissgerber P,Diehl S.Identifying refactorings from source-codechanges[C].Washington:IEEE Computer Society, 2006:231-240.
[7] Schmidt F,MacDonell S G,Connor A M.An automatic architecture reconstruction and refactoring framework[M].Berlin:Springer Berlin Heidelberg,2012:95-111.
[8] Silva F F,Borel E,Lopes E,et al.Towardsa difference detection algorithm aware of refactoring-relatedchanges[EB/OL].
[2017-05-11].10.1109/SBES.2014.21.
[9] Hunt J W.A fastalgorithm for computing longest common subsequences[J].Communications of the ACM,1977,20(5):350-353.
[10] Rysselberghe F N,Demeyer S.Reconstruction of successfulsoftware evolution using clone detection[C].Washington:IEEE Computer Society,2003:126.
[11] Roy C K,Cordy J R,Koschke R.Comparison and evaluation of code clone detection techniques and tools:a qualitative approach[J].Science of Computer Programming,2009,74(7):470-495.
[12] Xing Zhenchang,Stroulia E.Umldiff:an algorithm for object-oriented design differencing[EB/OL].
[2017-05-13]. 10.1145/1101908.1101919.
[13] Biegel B,Soetens Q D,Hornig W,et al.Comparison of similarity metrics for refactoring detection[EB/OL].
[2017-05-13].http://www.st.uni-trier.de/～diehl/pubs/msr11.pdf.
[14] Malpohl G,Hunt J J,Tichy W F.Renaming detection[J].Automated Software Engineering,2003,10(2):183-202.
[15] Malpohl G,Hunt J J,Tichy W F.Renaming detection[EB/OL].
[2017-05-13].https://www.researchgate.net/publication/3867122_Renaming_detection.
[16] Kim S,Pan K,Whitehead E J.When functions change their names:automatic detection of origin relationships[EB/OL].
[2017-05-13].https://users.soe.ucsc.edu/～ejw/papers/kim-wcre2005.pdf.
[17] Tsantalis N,Chatzigeorgiou A.Identification of extract method refactoring opportunities for the decomposition of methods[J].Journal of Systems and Software,2011,84(10):1757-1782.
[18] Silva D,Terra R,Valente M T.Recommending automated extract method refactorings[EB/OL].
[2017-05-13].http://www.ricardoterra.com.br/publications_files/2014_icpc.pdf.
[19] Prete K,Rachatasumrit N,Sudan N,et al.Template-based reconstruction of complex refactorings[EB/OL].
[2017-05-13].http://web.cs.ucla.edu/～miryung/Publications/icsm10-reffinder-slides.pdf.
[20] Kim M,Gee M,Loh A,et al.Ref-Finder:a refactoring reconstruction tool based on logic query templates[EB/OL].
[2017-05-13].http://web.cs.ucla.edu/～miryung/Publications/fse10-reffindertool.pdf.
[21] Prete K,Rachatasumrit N,Kim M.Catalogue of template refactoring rules[R].UTAUSTINECE-TR-041610,University of Texas,2010.
[22] 王映龙,杨炳儒,宋泽锋,等.基因序列相似程度的LCS算法研究[J].计算机工程与应用,2007,43(31):45-47.
[23] Apostolico,Guerra C.The longest common subsequence problem revisited[J].Algorithmica,1987,2(1/2/3/4):315- 336.
[24] Deken.Some limit results for longest common subsequences[J].Discrete Mathematics,1979,26(1):17- 31.