Affiliations: School of Computer Engineering, KIIT, Deemed To Be University, Bhubaneswar, Odisha, India
Correspondence:
[*]
Corresponding author: Niharika Pujari, School of Computer Engineering, KIIT, Deemed To Be University, Bhubaneswar, Odisha, India. E-mail: niharika.pujari06@gmail.com.
Abstract: A dynamic slicing algorithm is proposed in this paper along with its implementation which is dynamic for concurrent Component-oriented programs carrying multiple threads. As a part of representing the concurrent COP (CCOP) effectively, an intermediate graph is developed called Concurrent Component Dependency Graph (CCmDG). The system dependence graph (SDG) for individual components and interfaces are integrated to represent the above intermediate graph. It also consists of some new dependence edges which have been triggered for connecting the individual dependence graph of each component with the interface. Based on the graph created for the CCOP, a dynamic slicing algorithm is proposed, which sets the resultant by making the executed nodes marked during run time in Concurrent Components Dynamic Slicing (CCmDS) appropriately. For checking the competence of our algorithm, five case studies have been considered and also compared with an existing technique. From the study, we found that our algorithm results in smaller and precise size slice compared to the existing algorithm in less time.
Keywords: Program slicing, concurrent programming, web scrapper, component-oriented programs, thread connect edge, concurrent control flow graph (CCFG)
