Resumen:
Program slicing is a technique for program analysis and transformation with many different applications such as program debugging, program specialization, and parallelization. The system dependence graph (SDG) is the most commonly used data structure for program slicing. In this paper, we show that the presence of exception-handling constructs can make the SDG produce incorrect and sometimes even incomplete slices. We showcase the instances of incorrectness and incompleteness and we propose a new kind of control dependence: conditional control dependence; which produces more precise slices in the presence of catch statements.
Descargas:
La descarga de este artículo ha sido restringida por el autor
Ver la referencia en formato Bibtex
@inproceedings{prole:2021:005,
title={{Conditional Control Dependence to Represent Catch Statements in the System Dependence Graph}},
author={Carlos Galindo and Sergio Perez Rubio and Josep Silva},
url={http://hdl.handle.net/11705/PROLE/2021/005},
booktitle={PROLE2021},
year={2021},
publisher={SISTEDES},
crossref={prole2021malaga}
}
@proceedings{prole2021malaga,
title={{Actas de las XX Jornadas de Programaci{\'o}n y Lenguajes (PROLE 2021)}},
editor={Mart{\'i} Oliet, N. (Ed.)},
booktitle={PROLE2021},
year={2021},
publisher={SISTEDES}
}
Copiar al portapapeles |
Cerrar