Abstract
We propose an approach for computing relevant slices for feature-oriented programs. Our approach is based on an intermediate representation of the program called dynamic feature dependence graph (DFDG). We have named our proposed approach feature relevant slicing (FRS) algorithm. Our approach first computes the dynamic slice for a test case corresponding to the desired program location. Then, it determines the potential dependency for the desired program location, and eventually, it computes relevant slice using FRS algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Apel, S., Leich, T., Rosenmuller, M., Saake, G.: Combining feature-oriented and aspect-oriented programming to support software evolution. In: Proceedings of the 2nd ECOOP Workshop on Reflection, AOP and MetaData for Software Evolution (RAM-SE), pp. 3–16. School of Computer Science, University of Magdeburg (July 2005)
Apel, S., Leich, T., Rosenmuller, M., Saake, G.: FeatureC++: feature-oriented and aspect-oriented programming in C++. Technical report (2005)
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 (2005)
Batory, D.: A tutorial on feature oriented programming and the AHEAD Tool Suite. In: Proceedings of the 2005 International Conference on Generative and Transformational Techniques in Software Engineering (GTTSE’05), pp. 3–35. Berlin, Heidelberg (2006)
Chauhan, N.: Software Testing: Principles and Practices, 3rd edn. Oxford University Press (2012)
Gyimothy, T., Beszedes, A., Forgacs, I.: An efficient relevant slicing method for debugging. ACM SIGSOFT Softw. Eng. Notes 24(6), 303–321 (1999)
Jeffrey, D., Gupta, N.: Test case prioritization using relevant slices. In: Proceedings of 30th Annual International Computer Software and Applications Conference (COMPSAC’06), pp. 411–420. IEEE, 17–21 September 2006
Jeffrey, D., Gupta, N.: Experiments with test case prioritization using relevant slices. J. Syst. Softw. 81, 196–221 (2008)
Korel, B., Laski, J.: Algorithmic software fault localization. In: Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences, pp. 246–252 (1991)
Prehofer, C.: Feature-oriented programming: a fresh look at objects. In: Proceedings of 11th European Conference on Object-Oriented Programming (ECOOP), pp. 419–443 (1997)
Sahu, M., Mohapatra, DP.: Dynamic slicing of feature-oriented programs. In: Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics (ICACNI 2015), pp. 381–388. Bhubaneswar (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Sahu, M., Mohapatra, D.P. (2018). Relevant Slicing of Feature-Oriented Programs. In: Saeed, K., Chaki, N., Pati, B., Bakshi, S., Mohapatra, D. (eds) Progress in Advanced Computing and Intelligent Engineering. Advances in Intelligent Systems and Computing, vol 563. Springer, Singapore. https://doi.org/10.1007/978-981-10-6872-0_31
Download citation
DOI: https://doi.org/10.1007/978-981-10-6872-0_31
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6871-3
Online ISBN: 978-981-10-6872-0
eBook Packages: EngineeringEngineering (R0)