<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">José Bernardo Barros</style></author><author><style face="normal" font="default" size="100%">Daniela Cruz</style></author><author><style face="normal" font="default" size="100%">Pedro Rangel Henriques</style></author><author><style face="normal" font="default" size="100%">Jorge Sousa Pinto</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Assertion-based slicing and slice graphs</style></title><secondary-title><style face="normal" font="default" size="100%">Formal Aspects of Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Control flow graphs</style></keyword><keyword><style  face="normal" font="default" size="100%">Program analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">Verification conditions</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/jsp/files/sefm2010specslicing-camera-ready_0.pdf</style></url></related-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">London, UK, UK</style></pub-location><volume><style face="normal" font="default" size="100%">24</style></volume><pages><style face="normal" font="default" size="100%">217–248</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;
</style></abstract></record></records></xml>