Program slicing based on sentence executability

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 slicin...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Cavadini, Salvador V., Cheda, Diego A.
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2007
Materias:
Ciencias Informáticas
Informática
software engineering
program slicing
conditioning
necessary condition for execution
Plan execution, formation, and generation
Testing and Debugging
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/21951
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-21951
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Informática
software engineering
program slicing
conditioning
necessary condition for execution
Plan execution, formation, and generation
Testing and Debugging
spellingShingle Ciencias Informáticas
Informática
software engineering
program slicing
conditioning
necessary condition for execution
Plan execution, formation, and generation
Testing and Debugging
Cavadini, Salvador V.
Cheda, Diego A.
Program slicing based on sentence executability
topic_facet Ciencias Informáticas
Informática
software engineering
program slicing
conditioning
necessary condition for execution
Plan execution, formation, and generation
Testing and Debugging
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.
format Objeto de conferencia
Objeto de conferencia
author Cavadini, Salvador V.
Cheda, Diego A.
author_facet Cavadini, Salvador V.
Cheda, Diego A.
author_sort Cavadini, Salvador V.
title Program slicing based on sentence executability
title_short Program slicing based on sentence executability
title_full Program slicing based on sentence executability
title_fullStr Program slicing based on sentence executability
title_full_unstemmed Program slicing based on sentence executability
title_sort program slicing based on sentence executability
publishDate 2007
url http://sedici.unlp.edu.ar/handle/10915/21951
work_keys_str_mv AT cavadinisalvadorv programslicingbasedonsentenceexecutability
AT chedadiegoa programslicingbasedonsentenceexecutability
bdutipo_str Repositorios
_version_ 1764820465204854786

Ejemplares similares