Extracting Common and Variable Code using the LCS Algorithm for Migration to SPLE

Taeyoung Kim; Jihyun Lee; Sungwon Kang

doi:10.1109/COMPSAC57700.2023.00148

Extracting Common and Variable Code using the LCS Algorithm for Migration to SPLE

Taeyoung Kim^*
, Jihyun Lee
, Sungwon Kang

^*Corresponding author for this work

Research output: Contribution to conference › Conference paper › peer-review

2 Scopus citations

Abstract

The LCS (Longest Common Subsequence) algorithm is a well-known algorithm that finds the longest subsequence from two different strings while preserving the relative order between the characters that make up the strings. When migrating from source code to Software Product Line Engineering (SPLE), the process of identifying commonality and variability is a crucial step and many studies have applied the LCS algorithm for this process, but this algorithm can be applied only to two sources although the cases of three or more sources are common. This study proposes a method that extracts common and variable code lines from three or more sources. The proposed method consists of the preprocessing phase that divides sources into sections by reflecting the characteristics of their programming languages, and the phase for applying the LCS algorithm. To evaluate the proposed method, we applied it to ArgoUML-SPL and compared the result with the original platform of ArgoUML-SPL, which confirmed that common and variable code lines were effectively identified.

Original language	English
Title of host publication	Proceedings - 2023 IEEE 47th Annual Computers, Software, and Applications Conference, COMPSAC 2023
Editors	Hossain Shahriar, Yuuichi Teranishi, Alfredo Cuzzocrea, Moushumi Sharmin, Dave Towey, AKM Jahangir Alam Majumder, Hiroki Kashiwazaki, Ji-Jiang Yang, Michiharu Takemoto, Nazmus Sakib, Ryohei Banno, Sheikh Iqbal Ahamed
Publisher	IEEE Computer Society
Pages	1004-1005
Number of pages	2
ISBN (Electronic)	9798350326970
DOIs	https://doi.org/10.1109/COMPSAC57700.2023.00148
State	Published - 2023
Event	47th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2023 - Hybrid, Torino, Italy Duration: 2023.06.26 → 2023.06.30

Publication series

Name	Proceedings - International Computer Software and Applications Conference
Volume	2023-June
ISSN (Print)	0730-3157

Conference

Conference	47th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2023
Country/Territory	Italy
City	Hybrid, Torino
Period	23.06.26 → 23.06.30

Keywords

commonality and variability extraction
extractive approach
LCS algorithm
software product line
SPL migration

Quacquarelli Symonds(QS) Subject Topics

Computer Science & Information Systems
Data Science

Access to Document

10.1109/COMPSAC57700.2023.00148

Cite this

Kim, T., Lee, J., & Kang, S. (2023). Extracting Common and Variable Code using the LCS Algorithm for Migration to SPLE. In H. Shahriar, Y. Teranishi, A. Cuzzocrea, M. Sharmin, D. Towey, AKM. J. A. Majumder, H. Kashiwazaki, J.-J. Yang, M. Takemoto, N. Sakib, R. Banno, & S. I. Ahamed (Eds.), Proceedings - 2023 IEEE 47th Annual Computers, Software, and Applications Conference, COMPSAC 2023 (pp. 1004-1005). (Proceedings - International Computer Software and Applications Conference; Vol. 2023-June). IEEE Computer Society. https://doi.org/10.1109/COMPSAC57700.2023.00148

Kim, Taeyoung ; Lee, Jihyun ; Kang, Sungwon. / Extracting Common and Variable Code using the LCS Algorithm for Migration to SPLE. Proceedings - 2023 IEEE 47th Annual Computers, Software, and Applications Conference, COMPSAC 2023. editor / Hossain Shahriar ; Yuuichi Teranishi ; Alfredo Cuzzocrea ; Moushumi Sharmin ; Dave Towey ; AKM Jahangir Alam Majumder ; Hiroki Kashiwazaki ; Ji-Jiang Yang ; Michiharu Takemoto ; Nazmus Sakib ; Ryohei Banno ; Sheikh Iqbal Ahamed. IEEE Computer Society, 2023. pp. 1004-1005 (Proceedings - International Computer Software and Applications Conference).

@inproceedings{359a86a8e54a4135badc351f5cffae39,

title = "Extracting Common and Variable Code using the LCS Algorithm for Migration to SPLE",

abstract = "The LCS (Longest Common Subsequence) algorithm is a well-known algorithm that finds the longest subsequence from two different strings while preserving the relative order between the characters that make up the strings. When migrating from source code to Software Product Line Engineering (SPLE), the process of identifying commonality and variability is a crucial step and many studies have applied the LCS algorithm for this process, but this algorithm can be applied only to two sources although the cases of three or more sources are common. This study proposes a method that extracts common and variable code lines from three or more sources. The proposed method consists of the preprocessing phase that divides sources into sections by reflecting the characteristics of their programming languages, and the phase for applying the LCS algorithm. To evaluate the proposed method, we applied it to ArgoUML-SPL and compared the result with the original platform of ArgoUML-SPL, which confirmed that common and variable code lines were effectively identified.",

keywords = "commonality and variability extraction, extractive approach, LCS algorithm, software product line, SPL migration",

author = "Taeyoung Kim and Jihyun Lee and Sungwon Kang",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 47th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2023 ; Conference date: 26-06-2023 Through 30-06-2023",

year = "2023",

doi = "10.1109/COMPSAC57700.2023.00148",

language = "English",

series = "Proceedings - International Computer Software and Applications Conference",

publisher = "IEEE Computer Society",

pages = "1004--1005",

editor = "Hossain Shahriar and Yuuichi Teranishi and Alfredo Cuzzocrea and Moushumi Sharmin and Dave Towey and Majumder, \{AKM Jahangir Alam\} and Hiroki Kashiwazaki and Ji-Jiang Yang and Michiharu Takemoto and Nazmus Sakib and Ryohei Banno and Ahamed, \{Sheikh Iqbal\}",

booktitle = "Proceedings - 2023 IEEE 47th Annual Computers, Software, and Applications Conference, COMPSAC 2023",

}

Kim, T, Lee, J & Kang, S 2023, Extracting Common and Variable Code using the LCS Algorithm for Migration to SPLE. in H Shahriar, Y Teranishi, A Cuzzocrea, M Sharmin, D Towey, AKMJA Majumder, H Kashiwazaki, J-J Yang, M Takemoto, N Sakib, R Banno & SI Ahamed (eds), Proceedings - 2023 IEEE 47th Annual Computers, Software, and Applications Conference, COMPSAC 2023. Proceedings - International Computer Software and Applications Conference, vol. 2023-June, IEEE Computer Society, pp. 1004-1005, 47th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2023, Hybrid, Torino, Italy, 23.06.26. https://doi.org/10.1109/COMPSAC57700.2023.00148

Extracting Common and Variable Code using the LCS Algorithm for Migration to SPLE. / Kim, Taeyoung; Lee, Jihyun; Kang, Sungwon.
Proceedings - 2023 IEEE 47th Annual Computers, Software, and Applications Conference, COMPSAC 2023. ed. / Hossain Shahriar; Yuuichi Teranishi; Alfredo Cuzzocrea; Moushumi Sharmin; Dave Towey; AKM Jahangir Alam Majumder; Hiroki Kashiwazaki; Ji-Jiang Yang; Michiharu Takemoto; Nazmus Sakib; Ryohei Banno; Sheikh Iqbal Ahamed. IEEE Computer Society, 2023. p. 1004-1005 (Proceedings - International Computer Software and Applications Conference; Vol. 2023-June).

Research output: Contribution to conference › Conference paper › peer-review

TY - GEN

T1 - Extracting Common and Variable Code using the LCS Algorithm for Migration to SPLE

AU - Kim, Taeyoung

AU - Lee, Jihyun

AU - Kang, Sungwon

PY - 2023

Y1 - 2023

N2 - The LCS (Longest Common Subsequence) algorithm is a well-known algorithm that finds the longest subsequence from two different strings while preserving the relative order between the characters that make up the strings. When migrating from source code to Software Product Line Engineering (SPLE), the process of identifying commonality and variability is a crucial step and many studies have applied the LCS algorithm for this process, but this algorithm can be applied only to two sources although the cases of three or more sources are common. This study proposes a method that extracts common and variable code lines from three or more sources. The proposed method consists of the preprocessing phase that divides sources into sections by reflecting the characteristics of their programming languages, and the phase for applying the LCS algorithm. To evaluate the proposed method, we applied it to ArgoUML-SPL and compared the result with the original platform of ArgoUML-SPL, which confirmed that common and variable code lines were effectively identified.

AB - The LCS (Longest Common Subsequence) algorithm is a well-known algorithm that finds the longest subsequence from two different strings while preserving the relative order between the characters that make up the strings. When migrating from source code to Software Product Line Engineering (SPLE), the process of identifying commonality and variability is a crucial step and many studies have applied the LCS algorithm for this process, but this algorithm can be applied only to two sources although the cases of three or more sources are common. This study proposes a method that extracts common and variable code lines from three or more sources. The proposed method consists of the preprocessing phase that divides sources into sections by reflecting the characteristics of their programming languages, and the phase for applying the LCS algorithm. To evaluate the proposed method, we applied it to ArgoUML-SPL and compared the result with the original platform of ArgoUML-SPL, which confirmed that common and variable code lines were effectively identified.

KW - commonality and variability extraction

KW - extractive approach

KW - LCS algorithm

KW - software product line

KW - SPL migration

UR - https://www.scopus.com/pages/publications/85168876036

U2 - 10.1109/COMPSAC57700.2023.00148

DO - 10.1109/COMPSAC57700.2023.00148

M3 - Conference paper

AN - SCOPUS:85168876036

T3 - Proceedings - International Computer Software and Applications Conference

SP - 1004

EP - 1005

BT - Proceedings - 2023 IEEE 47th Annual Computers, Software, and Applications Conference, COMPSAC 2023

A2 - Shahriar, Hossain

A2 - Teranishi, Yuuichi

A2 - Cuzzocrea, Alfredo

A2 - Sharmin, Moushumi

A2 - Towey, Dave

A2 - Majumder, AKM Jahangir Alam

A2 - Kashiwazaki, Hiroki

A2 - Yang, Ji-Jiang

A2 - Takemoto, Michiharu

A2 - Sakib, Nazmus

A2 - Banno, Ryohei

A2 - Ahamed, Sheikh Iqbal

PB - IEEE Computer Society

T2 - 47th IEEE Annual Computers, Software, and Applications Conference, COMPSAC 2023

Y2 - 26 June 2023 through 30 June 2023

ER -

Kim T, Lee J, Kang S. Extracting Common and Variable Code using the LCS Algorithm for Migration to SPLE. In Shahriar H, Teranishi Y, Cuzzocrea A, Sharmin M, Towey D, Majumder AKMJA, Kashiwazaki H, Yang JJ, Takemoto M, Sakib N, Banno R, Ahamed SI, editors, Proceedings - 2023 IEEE 47th Annual Computers, Software, and Applications Conference, COMPSAC 2023. IEEE Computer Society. 2023. p. 1004-1005. (Proceedings - International Computer Software and Applications Conference). doi: 10.1109/COMPSAC57700.2023.00148

Extracting Common and Variable Code using the LCS Algorithm for Migration to SPLE

Abstract

Publication series

Conference

Keywords

Quacquarelli Symonds(QS) Subject Topics

Access to Document

Other files and links

Fingerprint

Cite this