An Approach for Computing Dynamic Slices of Structured Programs Using Dependence Relations
We propose a technique for computing dynamic slices of structured programs based on various types of dependence relations. First, we compute the static slice with respect to a variable given in the slicing criterion and store it in a slice file. Then, we execute the program for a given input and store various dependences in a table corresponding to the executed statements that are stored in the slice file. The slice is computed from the program path by taking dependences into account that are stored in a table. We have named our proposed algorithm as Program Dependence (PD) algorithm.
KeywordsDynamic slice Slicing criterion Program dependence relations
- 3.Jia, L., Jiao, H., Jie, L.: A dynamic program slice algorithm based on simplified dependence. In: Proceedings of 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE ‘10), vol. 4, pp. 356–359. (2010)Google Scholar
- 4.Zhang, R., Zheng, Y., Huang, S., Qi, Z.: Structured dynamic program slicing. In: Proceedings of International Conference on Computer and Management (CAMAN ‘11), pp. 1–4. (2011)Google Scholar
- 5.Jia, L., Chen, Z., Jin, Y.: A dynamic slice algorithm based on program dependence diagram. In: Proceedings of 2nd International Conference on Consumer Electronics, Communications and Networks (CECNet), pp. 273–276. (2012)Google Scholar
- 6.Jha, L., Patnaik, K.S.: A new method to compute dynamic slicing using program dependence graph. Int. J. Comput. Appl. 75(13), 30–36 (2013)Google Scholar