In this paper we are trying to combine the traditional proram slicing technique proposed by Mark Weiser[1] along with the static analysis and data ow analysis results on a given program to remove the statements that do not a ect a given property. Hence we named it Property Driven Program Slicing. In order to do that we apply a forward static analysis to extract properties of each variable in each program point, followed by a backward slicing algorithm to collect the slice based on the static analysis based informations.The aim of the present paper is to further re ne the traditional slicing technique by combining it with abstract interpretation and data ow analysis.This results into a deeper insight on the strong relation between slicing and property based dependency.
[1]
Mark Weiser,et al.
Program Slicing
,
1981,
IEEE Transactions on Software Engineering.
[2]
Flemming Nielson,et al.
Principles of Program Analysis
,
1999,
Springer Berlin Heidelberg.
[3]
Damiano Zanardini,et al.
Data dependencies and program slicing: from syntax to abstract semantics
,
2008,
PEPM '08.
[4]
Frank Tip,et al.
A survey of program slicing techniques
,
1994,
J. Program. Lang..
[5]
Patrick Cousot,et al.
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
,
1977,
POPL.