We introduce Tukra, a tool that allows the practical evaluation of abstract program slicing algorithms. The tool exploits the notions of statement relevancy, semantic data dependences and conditional dependences. The combination of these three notions allows Tukra to refine traditional syntax-based program dependence graphs, generating more accurate slices. We provide the architecture of the tool, some snapshots describing how it works, and some preliminary experimental results giving evidence of the accuracy improvements it supports
Program slicing is a commonly used approach for understanding and detecting the impact of changes to...
Program slicing is useful for assisting with software-maintenance tasks, such as program understandi...
In this paper, we present a new slicing technique named abstract program slicing that allows a decom...
We introduce Tukra, a tool that allows the practical evaluation of abstract program slicing algorith...
Mastroeni and Zanardini introduced the notion of semanticsbased data dependences, both at concrete a...
Many slicing techniques have been proposed based on the traditional Program Dependence Graph (PDG) r...
Abstract Many slicing techniques have been proposed based on the traditional Program Dependence Grap...
We discuss the relation between program slicing and data depen-dencies. We claim that slicing can be...
We discuss the relation between program slicing and data dependencies. We claim that slicing can be ...
The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging,...
In this paper, the notions of semantic relevancy of statements, semantic data dependences and condit...
This paper proposes a new approach to program slicing based on abstract interpretation and model che...
Program slicing is a technique to identify statements that may influence the computations in other s...
n the present article, we formally define the notion of abstract program slicing, a general form of ...
Abstract A program slice extracts a semantically meaningful portion of a program, based upon a user-...
Program slicing is a commonly used approach for understanding and detecting the impact of changes to...
Program slicing is useful for assisting with software-maintenance tasks, such as program understandi...
In this paper, we present a new slicing technique named abstract program slicing that allows a decom...
We introduce Tukra, a tool that allows the practical evaluation of abstract program slicing algorith...
Mastroeni and Zanardini introduced the notion of semanticsbased data dependences, both at concrete a...
Many slicing techniques have been proposed based on the traditional Program Dependence Graph (PDG) r...
Abstract Many slicing techniques have been proposed based on the traditional Program Dependence Grap...
We discuss the relation between program slicing and data depen-dencies. We claim that slicing can be...
We discuss the relation between program slicing and data dependencies. We claim that slicing can be ...
The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging,...
In this paper, the notions of semantic relevancy of statements, semantic data dependences and condit...
This paper proposes a new approach to program slicing based on abstract interpretation and model che...
Program slicing is a technique to identify statements that may influence the computations in other s...
n the present article, we formally define the notion of abstract program slicing, a general form of ...
Abstract A program slice extracts a semantically meaningful portion of a program, based upon a user-...
Program slicing is a commonly used approach for understanding and detecting the impact of changes to...
Program slicing is useful for assisting with software-maintenance tasks, such as program understandi...
In this paper, we present a new slicing technique named abstract program slicing that allows a decom...