%0 Journal Article
%J Formal Aspects of Computing
%D 2012
%T Assertion-based slicing and slice graphs
%A José Bernardo Barros
%A Daniela Cruz
%A Pedro Rangel Henriques
%A Jorge Sousa Pinto
%C London, UK, UK
%I Springer-Verlag
%K Control flow graphs
%K Program analysis
%K Verification conditions
%P 217–248
%R 10.1007/s00165-011-0196-1
%V 24
%X <p>This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than using criteria based on control/data dependencies. We show how the forward propagation of preconditions and the backward propagation of post conditions can be combined in a new slicing algorithm that is more precise than the existing specification-based algorithms. The algorithm is based on (i) a precise test for removable statements, and (ii) the construction of a slice graph, a program control flow graph extended with semantic labels. It improves on previous approaches in two aspects: it does not fail to identify removable commands; and it produces the smallest possible slice that can be obtained (in a sense that will be made precise). The paper also reviews in detail, through examples, the ideas behind the use of preconditions and post conditions for slicing programs.</p>
%> https://haslab.uminho.pt/sites/default/files/jsp/files/sefm2010specslicing-camera-ready_0.pdf