Paper Info
Title
Data dependencies and program slicing: from syntax to abstract semantics
Abstract
We discuss the relation between program slicing and data dependencies. We claim that slicing can be defined, and therefore calculated, parametrically on the chosen notion of dependency, which implies a different result when building the program dependency graph. In this framework, it is possible to choose dependency in the syntactic or semantic sense, thus leading to compute possibly different, smaller slices. Moreover, the notion of abstract dependency, based on properties instead of exact data values, is investigated in its theoretical meaning. Constructive ideas are given to compute abstract dependencies on expressions, and to transform properties in order to rule out some dependencies. The application of these ideas to information flow is also discussed.
Year
DOI
Venue
2008
10.1145/1328408.1328428
PEPM
Keywords
Field
DocType
exact data value,abstract dependency,chosen notion,information flow,constructive idea,different result,smaller slice,abstract semantics,data dependency,program dependency graph,semantic sense,program slicing,formal methods,semantics,security,theory,dependence analysis,dependency analysis,program analysis
Program slicing,Programming language,Multivalued dependency,Expression (mathematics),Constructive,Abstract interpretation,Computer science,Join dependency,Theoretical computer science,Dependency graph,Dependency theory (database theory)
Conference
Citations 
PageRank 
References 
20
0.66
19
Authors
2
Name
Order
Citations
PageRank
Isabella Mastroeni125824.22
Damiano Zanardini232416.83