The conventional notion of a program slice|the set of all statements that might a ect the value of a variable occurrence|is totally independent of the program input values. Program debugging, however, involves analyzing the program behavior under the speci c inputs that revealed the bug. In this paper we address the dynamic counterpart of the static slicing problem | nding all statements that really a ected the value of a variable occurrence for the given program inputs. Several approaches for computing dynamic slices are examined. The notion of a Dynamic Dependence Graph and its use in computing dynamic slices is discussed. We introduce the concept of a Reduced Dynamic Dependence Graph whose size does not depend on the length of execution history, which is unbounded in general, but whose size is bounded and is proportional to the number of dynamic slices arising during the program execution. 1
|
2317
|
Graph-Based Algorithms for Boolean Function Manipulation
– Bryant
- 1986
|
|
2138
|
UCI Repository of Machine Learning Databases
– Blake, Merz
- 1998
|
|
1143
|
Matrix Computations
– Golub, Loan
- 1989
|
|
908
|
Program slicing
– Weiser
- 1984
|
|
724
|
Symbolic boolean manipulation with Ordered Binary Decision Diagrams
– Bryant
- 1992
|
|
672
|
The program dependence graph and its use in optimization
– Ferrante, Ottenstein, et al.
- 1987
|
|
519
|
Interprocedural slicing using dependence graphs
– Horwitz, Reps, et al.
- 1990
|
|
328
|
A “HOW to Play Any Mental Game or A Completeness Theorem for Protocols with Honest Majority
– Goldreich, Micali, et al.
- 1987
|
|
234
|
The Program Dependence Graph in a Software Development
– Ottenstein, Ottenstein
|
|
232
|
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
– Bryant
- 1991
|
|
219
|
Programmers Use Slices When Debugging
– Weiser
- 1982
|
|
218
|
Dependence graphs and compiler optimizations
– Kuck, Kuhn, et al.
- 1981
|
|
215
|
Intergrating Noninterfering Version of Programs
– Horwitz, Reps, et al.
- 1989
|
|
214
|
Dynamic program slicing
– Agrawal, Horgan
- 1990
|
|
183
|
Privacy preserving data mining
– Lindell, Pinkas
- 2000
|
|
166
|
The complexity of finite functions
– Boppana, Sipser
- 1989
|
|
161
|
Dynamic program slicing
– Korel, Laski
- 1988
|
|
114
|
Limiting privacy breaches in privacy preserving data mining
– Evfimievski, Gehrke, et al.
- 2003
|
|
98
|
Information sharing across private databases
– Agrawal, Evfimievski, et al.
- 2003
|
|
79
|
Efficient Private Matching and Set Intersection
– Freedman, Nissim, et al.
- 2004
|
|
73
|
Maintaining data privacy in association rule mining
– Rizvi, Haritsa
- 2002
|
|
53
|
On lower bounds for readk-times branching programs
– Borodin, Razborov, et al.
- 1993
|
|
36
|
A data distortion by probability distribution
– Liew, Choi, et al.
- 1985
|
|
36
|
Convex Polytopes. Interscience
– Grunbaum
- 1967
|
|
29
|
J.C.: Security control methods for statistical databases: a comparative study
– Adam, Wortmann
- 1989
|
|
28
|
Controlled data-swapping techniques for masking public use microdata sets
– Moore
- 1996
|
|
27
|
On the size of binary decision diagrams representing boolean functions
– Breitbart, Hunt, et al.
- 1995
|
|
24
|
On the power of randomized branching programs
– Ablayev, Karpinski
- 1996
|
|
20
|
Enhancing privacy and trust in electronic communities
– Huberman, Franklin, et al.
- 1999
|
|
14
|
A measure of asymptotic efficiency for tests based on the sum of observations
– Chernoff
- 1952
|
|
14
|
Securing OLAP data cubes against privacy breaches
– Wang, Jajodia, et al.
- 2004
|
|
12
|
EXDAMS-EXtendable debugging and monitoring system
– BALZER
|
|
10
|
Hierarchy theorems for kOBDDs and kIBDDs
– Bollig, Sauerhoff, et al.
- 1998
|
|
8
|
Randomization and nondeterminism are incomparable for ordered read-once branching programs
– Ablayev
- 1997
|
|
8
|
The effect of null-chains on the complexity of contact schemes
– Jukna
- 1989
|
|
7
|
A mechanism for e cient debugging of parallel programs
– Miller, Choi
- 1988
|
|
6
|
A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs, ECCC TR98011
– Ablayev, Karpinski
- 1998
|
|
5
|
Models and methods for the microdata protection problem
– Hurkens, Tiourine
- 1998
|
|
3
|
Cardinality-based inference control in data cubes
– Wang, Wijesekera, et al.
- 2003
|
|
1
|
Privacy preserving mining of association rules
– Ferrer, Torra
|
