| dc.creator | Cavadini, Salvador V. | |
| dc.creator | Cheda, Diego A. | |
| dc.date | 2007 | |
| dc.date | 2012-10-02T20:24:11Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/21951 | |
| dc.description | We present point slicing, a new slicing technique for imperative programs that gives an answer to the question Which sentences can be executed if sentence p is executed?, very common in program testing, debugging, and understanding tasks and, as far as we know, not directly addressed by other slicing techniques. Point slicing uses a program point as criterion and computes slices by deleting sentences that are proved to be not reachables by executions including the criterion point. We also show how to extend point slicing criterion to a set of program points and how the new technique can be also used to answer to a more precise question: Which sentences are possibly executed if sentence p is executed in a program state satisfying condition Á? Because, minimal point slices are, in general, not computable, we provide definitions of safe approximations for each type of point slice. | |
| dc.description | IV Workshop de Ingeniería de Software y Base de Datos | |
| dc.description | Red de Universidades con Carreras en Informática (RedUNCI) | |
| dc.format | application/pdf | |
| dc.format | 485-497 | |
| dc.language | en | |
| dc.relation | XIII Congreso Argentino de Ciencias de la Computación | |
| dc.rights | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
| dc.rights | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
| dc.subject | Ciencias Informáticas | |
| dc.subject | Informática | |
| dc.title | Program slicing based on sentence executability | |
| dc.type | Objeto de conferencia | |
| dc.type | Objeto de conferencia | |
