Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2026-07-23 16:15
Identifying Undetected Clone Pairs Using the Transitional Relationships of Detected Clone Pairs
Ryosuke Ishimura, Yoshiki Higo (UOsaka) SS2026-23 KBSE2026-23
Abstract (in Japanese) (See Japanese page) 
(in English) In code clone detection, calculating similarity for all possible combinations of methods results in a very high computational load. For this reason, detectors such as NIL and NiCad perform filtering before calculating similarity to exclude pairs that are unlikely to be clones from the candidate set. While such filtering is effective for reducing execution time, there is a risk that code clones that should be detected may be mistakenly excluded. In this study, we focus on the transitive relation of code clone relationships and propose a method that supplements, as a post-processing step, pairs that were excluded from similarity calculations due to filtering. In the proposed method, if method pairs (????,????) and (????,????) are detected as clones but (????,????) is not, (????,????) is collected as a transitive law-missing pair. We then calculate the similarity for these transitive rule-missing pairs and add those that satisfy the conditions to the detection results. Experiments targeting Java OSS showed that the proposed method improved recall with minimal overhead. Specifically, using NIL’s default parameter settings, the proposed method further improved Recall—which was already 0.90 or higher when using NIL alone—by 0.01 to 0.05, with a maximum additional execution time of 0.3 seconds. This demonstrates the potential to mitigate the trade-off between execution time and detection omissions in code clone detection.
Keyword (in Japanese) (See Japanese page) 
(in English) Code clone / Transitive relation / NIL / / / / /  
Reference Info. IEICE Tech. Rep., vol. 126, no. 125, SS2026-23, pp. 133-138, July 2026.
Paper # SS2026-23 
Date of Issue 2026-07-15 (SS, KBSE) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF SS2026-23 KBSE2026-23

Conference Information
Committee SS KBSE IPSJ-SE  
Conference Date 2026-07-22 - 2026-07-24 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To SS 
Conference Code 2026-07-SS-KBSE-SE 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Identifying Undetected Clone Pairs Using the Transitional Relationships of Detected Clone Pairs 
Sub Title (in English)  
Keyword(1) Code clone  
Keyword(2) Transitive relation  
Keyword(3) NIL  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Ryosuke Ishimura  
1st Author's Affiliation The University of Osaka (UOsaka)
2nd Author's Name Yoshiki Higo  
2nd Author's Affiliation The University of Osaka (UOsaka)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2026-07-23 16:15:00 
Presentation Time 20 minutes 
Registration for SS 
Paper # SS2026-23, KBSE2026-23 
Volume (vol) vol.126 
Number (no) no.125(SS), no.126(KBSE) 
Page pp.133-138 
#Pages 6 
Date of Issue 2026-07-15 (SS, KBSE) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan