Abstract
Program slicing is a method for automatical program decomposition. This paper presents an improved slicing algorithm on the basis of static analysis of the control structure of loop statements. The slice obtained by the new algorithm is guaranteed to be no larger than that obtained by the previous slicing algorithm developed by Mark Weiser. Moreover, the former will be much smaller than the latter for certain kinds of programs. In addition, a brief discussion of using slicing in program verification has been given for the sake of extending the application area of program slicing.
Similar content being viewed by others
References
M. Weiser, Program slicing,IEEE Transaction on Software Engineering, Se-10:4 (1984).
M. Weiser, Program slicing, Proc. Fifth Int. Conf. on Software Eng., San Diago, CA., Mar. 1981.
M. Weiser, Programmers use slices when debugging,CACM,25:7 (1982).
A. V. Aho, and J. D. Ullman, Principle of Compiler Design, Addison-Wesley, 1977.
S. Muchnick, and N. J. Jones, Program Flow Analysis: Theory and Application. Prentice-Hall, Inc., Englewood Cliffs, New Jersy, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lu, Q., Zhang, F. & Qian, J. Program slicing: Its improved algorithm and application in verification. J. of Comput. Sci. & Technol. 3, 29–39 (1988). https://doi.org/10.1007/BF02943330
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02943330