Slicing Based on Web Scrapped Concurrent Component

Abstract

In this paper, we have proposed an algorithm for dynamic slicing of concurrent COPs that consist of multiple threads. In order to portray the concurrent COP effectively, an intermediate representation graph called concurrent component-oriented dependency graph (CCmDG) is developed based on the dependencies among all the edges. The intermediate representation graph developed for component-oriented programs consists of system dependence graph (SDG) for individual components, along with that some new dependence edges are introduced that are used to connect each system dependency graph to the interface. Based on the intermediate graph created in first step, a dynamic slicing algorithm is proposed for undertaken case study for the concurrent component-oriented program. The resultant is a graph marking and unmarking the executed nodes in concurrent components dynamic slicing (CCmDS) appropriately during run-time.