Assertion-based Slicing and Slice Graphs Daniela Cruz en José Bernardo Barros en Jorge Sousa Pinto en Pedro Rangel Henriques en 2017-11-16T14:07:06Z 2017-11-16T14:07:06Z 2012 en
dc.description.abstract 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. en
dc.identifier.uri en
dc.language eng en
dc.relation 5595 en
dc.relation 5641 en
dc.rights info:eu-repo/semantics/openAccess en
dc.title Assertion-based Slicing and Slice Graphs en
dc.type article en
dc.type Publication en