Affordable Access

Program slicing using weakest preconditions

IFIP Lecture Notes in Computer Science (LNCS)
Publication Date
  • Computer Science
  • Logic


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 , defined using Dijkstras weakest precondition (wp), to determine which statements will affect a specified predicate. Weakest preconditions are already known to be an effective technique for program understanding and analysis, and this paper unifies wp analysis and slicing and simplifies existing slicing algorithms. Slicing rules for assignment, conditional, and repetition statements are developed. The authors are currently using these techniques in their work with software maintenance teams and are incorporating p-slice computation into a program analysis tool.Full Text at Springer, may require registration or fee

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times