Eclipse A Tool Support to Merge Similer Methods with Differences Akira Goto 1 Norihiro Yoshida 2 Masakazu Ioka 1 Katsuro Inoue 1 Abstra

Size: px

Start display at page:

Download "Eclipse A Tool Support to Merge Similer Methods with Differences Akira Goto 1 Norihiro Yoshida 2 Masakazu Ioka 1 Katsuro Inoue 1 Abstra"

りさこたにしき
5 years ago
Views:

1 Title 差分を含む類似メソッドの集約支援ツール Author(s) Citation 後藤, 祥 ; 吉田, 則裕 ; 井岡, 正和 ; 井上, 克郎ソフトウェアエンジニアリングシンポジウム 2012 論文集 P.1-P.6 Issue Date Text Version publisher URL DOI rights ここに掲載した著作物の利用に関する注意本著作物の著作権は情報処理学会に帰属します本著作物は著作権者である情報処理学会の許可のもとに掲載するものですご利用に当たっては著作権法ならびに情報処理学会倫理綱領に従うことをお願いいたします

2 Eclipse A Tool Support to Merge Similer Methods with Differences Akira Goto 1 Norihiro Yoshida 2 Masakazu Ioka 1 Katsuro Inoue 1 Abstract: A method that has identical or similar methods is called similar method. Merging similar methods into a single method is often performed to improve the maintainability of a program. However, it is difficult for a developer to merge similar methods with differences. In this paper, we propose an approach that supports to merge similar methods with differences by showing candidates of merging similar methods. The proposed approach has been implemented as a plugin of Eclipse. In the case study, we applied the proposed approach to actual similar methods in open source projects. As a result, we confirmed useful candidates in the output of the proposed approach by the questionnaire. 1. [11] 2 [2] Template Method Template Method [2]Template Method 1 Osaka University 2 Nara Institute of Science and Technology 4 (2 2 ) 4 () ( 1) ( 1 1) (AST) ( 1 23) ( 1 4) ( 1 5) c 2012 Information Processing Society of Japan 1

2012 Fig. 1 1 Overview of the Proposed Approach Fig. 2 2 AST An Example of Indexing for Particular Nodes in AST AST 2 AST Eclipse 2. M A M B AST 2 1 ( ) 5 2.

3 2012 Fig. 1 1 Overview of the Proposed Approach Fig. 2 2 AST An Example of Indexing for Particular Nodes in AST AST 2 AST Eclipse 2. M A M B AST 2 1 ( ) M A M B AST Eclipse JDT AST AST (Assginment Expression ) () AST AST 1 (ExpressionStatement) (Return- Statement) AST AST 2 N A N B (1) N A N B N A N B AST N A N B N A N B N A N B Block (1) Block (2) (2) Block Block Block [1] AST 3 AST ( 3 ) c 2012 Information Processing Society of Japan 2

4 2012 Fig. 3 3 Detecting Statement-level Differences between Similar Methods 5 Fig. 5 Expansion for Code Fragments 4 Fig. 4 Merging Differences (2.3 ) () i (i + 1) (i 1) (Block ) Block Block M A M B ( A, B ) δ Ai A M A M B δ Bi B 2.3 ( A, B ) 2 M B M A A, B ( A = B = n) E A, E B ( E A = E B = m, 1 m n) A *1 B E A, E B E A, E B C e Ai, e Aj E A (i j) (E B ) D δ Ai A e Aj E A 1 ( B E B ) δ δ include(δ) include(δ) δ AST AST cf δ 5 1 () cf AST () i max i min (i max + 1) (i min 1) *1 [5] Figure.2 c 2012 Information Processing Society of Japan 3

5 2012 cf cf include(δ) cf cf 2 2 () cf AST cf cf include(δ) cf Method Declaration 1 A, B {include(δ A1 ), include(δ A2 ),, include(δ An )} {include(δ B1 ), include(δ B2 ),, include(δ Bn )} include(δ) len(e Ai ) len(m A ) > threshold, len(e Bi) len(m B ) > threshold len(x) x e Ai E A e Bi E B 1 3. Template Method [7] [6], [8] M len(m) M V M V i M V o M F SL x x BSL x x SL int V i V o F T ightness(m) = SL int len(m) F Coverage(M) = 1 V ( x V i F SL x len(m) + x V o BSL x len(m) ) F Overlap(M) = 1 V ( x V i SL int F SL x + x V o SL int BSL x ) Eclipse Ant ANTLR 2 1 *2 *2 Ant : executedrawoperation (Arc,Ellipse ) ANTLR : generrorhandler (CppCodeGenerator,JavaCodeGenerator ) c 2012 Information Processing Society of Japan 4

2012 6 Fig. 6 A Screenshot of the Tool 3 10 15 5.1 2 1 (ARSC) 2 (AP) [1] A P (A i ) A i AP = 1 A P (A i ) (1) A i=1 5.2 Ant 23 ANTLR 34 Ant 14 ANTLR 6 ANTLR 6 0.5 1 0.213 0.267 2 Ant 0.

6 Fig. 6 A Screenshot of the Tool (ARSC) 2 (AP) [1] A P (A i ) A i AP = 1 A P (A i ) (1) A i=1 5.2 Ant 23 ANTLR 34 Ant 14 ANTLR 6 ANTLR Ant 0.5 Ant ANTLR Table 1 Result of the Questionnaire ARSC AP FTightness Ant FCoverage FOverlap FTightness ANTLR FCoverage FOverlap c 2012 Information Processing Society of Japan 5

7 COB [9], [10] [9] Juillerat Template Method [4] Template Method Hotta [3]Hotta Template Method AST 1 A: C) : [1] Baeza-Yates, R. and Ribeiro-Neto, B.: Modern Information Retrieval, Addison Wesley, second edition (2011). [2] Fowler, M.: Refactoring: Improving the Design of Existing Code, Addison Wesley (1999). [3] Hotta, K., Higo, Y. and Kusumoto, S.: Identifying, Tailoring, and Suggesting Form Template Method Refactoring Opportunities with Program Dependence Graph, Proc. of CSMR2012, pp (2012). [4] Juillerat, N. and Hirsbrunner, B.: Toward an Implementation of the Form Template Method Refactoring, Proc. of SCAM2007, pp (2007). [5] Murphy-hill, E. and Black, A. P.: Breaking the barriers to successful refactoring: observations and tools for extract method, Proc. of ICSE2008, pp (2008). [6] Ott, L. M. and Thuss, J. J.: Slice Based Metrics for Estimating Cohesion, Proc. of METRICS1993, pp (1993). [7] Stevens, W. P., Myers, G. J. and Constatine, L. L.: Structured design, IBM Syst.J, Vol. 13, No. 2, pp (1974). [8] Weiser, M.: Program slicing, Proc. of ICSE1981, pp (1981). [9] COB Template Method Vol. 111, No. 169, pp (2011). [10] XVIIpp (2010). [11] (D)Vol. J91-D, No. 6, pp (2008). 3 c 2012 Information Processing Society of Japan 6

1,a) 1,b) TUBSTAP TUBSTAP Offering New Benchmark Maps for Turn Based Strategy Game Tomihiro Kimura 1,a) Kokolo Ikeda 1,b) Abstract: Tsume-shogi and Ts

1,a) 1,b) TUBSTAP TUBSTAP Offering New Benchmark Maps for Turn Based Strategy Game Tomihiro Kimura 1,a) Kokolo Ikeda 1,b) Abstract: Tsume-shogi and Ts JAIST Reposi https://dspace.j Title ターン制戦略ゲームにおけるベンチマークマップの提案 Author(s) 木村, 富宏 ; 池田, 心 Citation ゲームプログラミングワークショップ 2016 論文集, 2016: 36-43 Issue Date 2016-10-28 Type Conference Paper Text version author