Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Proceedings of the 26th International Conference on Software Engineering
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Using Dynamic Information in the Interprocedural Static Slicing of Binary Executables
Software Quality Control
Cost and precision tradeoffs of dynamic data slicing algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient interprocedural dynamic slicing method
Journal of Systems and Software
Slicing as a program transformation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A vocabulary of program slicing-based techniques
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Owing to its relative simplicity and wide range of applications,static slices are specifically proposed for softwaremaintenance and programunderstanding. Unfortunately, inmany cases static slices are overly conservative and thereforetoo large to supply useful information to the softwaremaintainer. Dynamic slicing methods can produce moreprecise results, but only for one test case. In this paper weintroduce the concept of union slices (the union of dynamicslices for many test cases) and suggest using a combinationof static and union slices. This way the size of programparts that need to be investigated can be reduced by concentratingon the most important parts first. We performeda series of experiments with our experimental implementationon three medium size C programs. Our initial resultssuggest that union slices are in most cases far smaller thanthe static slices, and that the growth rate of union slices (byadding more test cases) significantly declines after severalrepresentative executions of the program.