Program Slicing Using Weakest Preconditions

  title={Program Slicing Using Weakest Preconditions},
  author={Joseph J. Comuzzi and Johnson M. Hart},
Program slices have long been used as an aid to program understanding, especially in maintenance activities. Most slicing methods involve data and control flow analysis to determine what statements might affect a set of variables. Here, we develop a more precise slicing concept, called p-slices, defined using Dijkstra’s weakest precondition (wp), to determine which statements will affect a specified predicate. Weakest preconditions are already known to be an effective technique for program… CONTINUE READING
18 Citations
16 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 18 extracted citations


Publications referenced by this paper.
Showing 1-10 of 16 references

of Programming

  • E. W. Dijkstra, A Disciplin
  • Englewood Cliffs, NJ: Prentice-Hall,
  • 1976
Highly Influential
12 Excerpts

Programming in the 1990s

  • E. Cohen
  • NY: Springer-Verlag,
  • 1990
Highly Influential
5 Excerpts

Program slicing,” IEEE Trans

  • M. Weiser
  • Software Eng., vol. SE-10, pp. 352-357, July
  • 1984
Highly Influential
11 Excerpts

Similar Papers

Loading similar papers…