Program slicing for C-the problems in implementation
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 182-190
- https://doi.org/10.1109/icsm.1991.160328
Abstract
Program slicing is a method of finding all statements that might directly or indirectly affect the values of variables. The concept was first proposed by M. Weiser (1981, 1984). Some of the problems and possible solutions of program slicing within the C language are discussed. Some basic notations and Weiser's original algorithm are presented. Then, slicing problems and solutions are described. For instance, how to find the correct slice in the presence or array and pointer variables and how to find break, continue, and goto statements that have effects on the slice. An algorithm to find the branch statements is introduced.Keywords
This publication has 12 references indexed in Scilit:
- Semi-automatic bug localization in software maintenancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Interprocedural slicing using dependence graphsPublished by Association for Computing Machinery (ACM) ,1988
- Efficient computation of flow-insensitive interprocedural summary information—a correctionACM SIGPLAN Notices, 1988
- Using program decomposition to guide modificationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Comments on Program SlicingIEEE Transactions on Software Engineering, 1987
- Program SlicingIEEE Transactions on Software Engineering, 1984
- Efficient computation of flow insensitive interprocedural summary informationACM SIGPLAN Notices, 1984
- Programmers use slices when debuggingCommunications of the ACM, 1982
- Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variablesPublished by Association for Computing Machinery (ACM) ,1980
- A practical interprocedural data flow analysis algorithmCommunications of the ACM, 1978