Dynamic Slicing Algorithm for FeatureC++ Programs

Program slicing is defined as a method required to abstract some statements from a code by analyzing different types of dependency existing in the program. The important application of program slicing is code debugging, different types of testing, software maintenance, program integration, program specialization, and code reuse. Feature-oriented programming(FOP) paradigm is a program design technique where distinct program structures are defined disjointedly and then combined to make a varied types of software products. Feature-Oriented Programming is an overall model for creating programs in different software product lines. The exceptional qualities of feature-oriented programming are mixin layers, classes', and refinements of constructors. This paper offers a new dynamic slicing algorithm for different FeatureC++ programs known as the Feature-oriented Node Marking Unmarking Algorithm (FNMUA). The FNMUA algorithm works on a dependency-based graphical illustration called Feature-oriented Dependence Graph (FoDG). The foremost intention of the proposed algorithm is to compute the FOP's accurate and precise slices.