基于K 最近邻的C克隆代码重构方法研究-计算机科学与技术专业论文.docxVIP

Classified Index: TP311.5 U.D.C.: 681 Dissertation for the Master Degree in Engineering CODE CLONE RESTRUCTURING OF C PROGRAMS VIA K-NEAREST NEIGHBOR ALGORITHM Candidate： Feng Jianghui Supervisor： Prof. Su Xiaohong Academic Degree Applied for： Master of Engineering Speciality： Computer Science and Technology Affiliation： School of Computer Science and Technology Date of Defence： June, 2011 Degree-Conferring-Institution： Harbin Institute of Technology 摘 要 随着计算机软件的快速发展，程序员开始对软件进行复用以减少工作量。但 是这种方法的结果是软件系统中充斥着大量的克隆代码。在大部分情况下，克隆 代码对系统是有害的，它增加了软件的长度，使软件体系架构变得更加臃肿，维 护起来非常困难，降低了系统运行效率，并且导致软件中存在很多的错误。而重 构技术的出现，可以有效对克隆代码进行处理，降低其对系统的危害。但是目前 对克隆代码重构的研究还不是很多。 针对目前的现状，本文提出了一种基于 K-最近邻的克隆代码重构方法。该方 法首先为 C 克隆代码构造语法树，并在语法树的基础上建立程序依赖图，然后进 行静态分析，从而获得程序的控制流信息和数据流信息。然后，采用基于控制依 赖子图的 K-最近邻聚类算法对代码进行分析，选取可执行语句作为实体，利用数 据属性和控制属性对实体进行归类，分离出便于提取、功能独立的代码片段。接 着，调用基于抽象语法树的过程提取算法，求得变量类型，确定要提取的过程的 参数类型及个数，解决新过程的返回值问题，最后将代码片段提取为独立的过程， 并用过程调用替换其在源代码中的位置。 本文使用已有文献中的代码和开源代码对基于 K-最近邻的克隆代码重构方法 模型进行了测试。实验结果表明，本文提出的重构模型能够有效地提取内聚度低、 功能交叉的克隆代码，具有较高的聚类准确性。 关键字：重构；K-最近邻；过程提取；静态分析 Abstract With the development of computer software, the developers begin to reuse the software to reduce the workload. However, this method will cause the software system is flooded with a large number of clone code. Clone code in most cases is harmful to the system, which increases the length of software code and makes software more complex, difficult to maintain. The system will be inefficient and introduced a number of defects. However, clone code can be processed effectively through restructuring so as to reduce the harm of clone code on the system. But current researches on restructuring clone code are very few. According to present situation, we propose a clone restructuring approach based on k-nearest neighbor algorithm. This method first takes the clone code of C programs as input and generates parser tree. Based on parser tree built above, program dependence graph is established and static analysis is performed, through whic