Dynamic Slicing of Feature-Oriented Programs

Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 44)

Abstract

We intend to suggest a dynamic slicing algorithm for feature-oriented programs. We have named our algorithm Execution Trace file Based Dynamic Slicing (ETBDS) algorithm. The ETBDS algorithm constructs an intermediate program representation known as Dynamic Feature-Oriented Dependence Graph (DFDG) based on various dependences exist amongst the program statements. We use an execution trace file to keep the execution history of the program. The dynamic slice is computed by first performing breadth-first or depth-first traversal on the DFDG and then mapping out the resultant nodes to the program statements.

Keywords

Feature-oriented programming (FOP) Dynamic feature-oriented dependence graph (DFDG) FeatureC++ Mixin layer 

References

  1. 1.
    Apel, S., Leich, T., Rosenmuller, M., Saake, G.: FeatureC++: on the symbiosis of feature-oriented and aspect-oriented programming. In: Proceedings of the International Conference on Generative Programming and Component Engineering (GPCE’05), pp. 125–140. Springer, Berlin (2005)Google Scholar
  2. 2.
    Apel, S., Leich, T., Rosenmuller, M., Saake, G.: FeatureC++: feature-oriented and aspect-oriented programming in C++. Technical report (2005)Google Scholar
  3. 3.
    Mohapatra, D.P., Sahu, M., Mall, R., Kumar, R.: Dynamic slicing of aspect-oriented programs. Informatica 32(3), 261–274 (2008)MATHGoogle Scholar
  4. 4.
    Prehofer, C.: Feature-oriented programming: a fresh look at objects. In: Proceedings of 11th ECOOP, Lecture Notes in Computer Science, pp. 419–443. Springer, Berlin, Heidelberg (1997)Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Department of Computer Science & EngineeringNational Institute of TechnologyRourkelaIndia

Personalised recommendations