Duplicated Code Slicing Technique for System Optimization
Seunghyung Lee1, Sungho Sim2

1Sungho Sim, College of General Education, Semyung University, Jecheon-si, Korea.
2Seunghyung Lee, Department of Computer Engineering, Kyung Hee University, Youngin-si, Korea.
Manuscript received on 19 August 2019 | Revised Manuscript received on 29 August 2019 | Manuscript Published on 16 September 2019 | PP: 415-419 | Volume-8 Issue-2S6 July 2019 | Retrieval Number: B10780782S619/2019©BEIESP | DOI: 10.35940/ijrte.B1078.0782S619
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: These days, the systems have been bigger upon integrations with multiple functions of hardware and software. To optimize these bigger systems, slicing technique is required to extract the duplicated codes. In this study, system dependent graph was used for slicing of duplicated codes. System dependent graph is generated upon analysis of extracted control relationship from system codes and data dependence. Duplicated control and data relations are extracted upon analysis of generated system dependent graph. Using control and data relations, which is a suggestive slicing technique, duplicated codes can be generated. Slicing technique using system dependent graph can be applied to the extraction of duplicated cross cutting modules in all programming methods regardless of the environment of structure/object-oriented program. By the suggestive method, code blocks duplicated. In the system can be sliced and system code optimization can be contributed by eliminating unnecessary codes from slicing.
Keywords: Control Dependence Relation, Duplicated Code Slicing, System Optimization, Data Dependence Relation, Source Code.
Scope of the Article: Discrete Optimization