Locating Features in Source Code
IEEE Transactions on Software Engineering
Precise dynamic slicing algorithms
Proceedings of the 25th International Conference on Software Engineering
Cost effective dynamic program slicing
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Proceedings of the 26th International Conference on Software Engineering
A Fast Assembly Level Reverse Execution Method via Dynamic Slicing
Proceedings of the 26th International Conference on Software Engineering
Hypertext support for the information needs of software maintainers
Journal of Software Maintenance and Evolution: Research and Practice
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)
Experimental evaluation of using dynamic slices for fault location
Proceedings of the sixth international symposium on Automated analysis-driven debugging
Locating faulty code using failure-inducing chops
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
An efficient interprocedural dynamic slicing method
Journal of Systems and Software
Theoretical foundations of dynamic program slicing
Theoretical Computer Science
A study of effectiveness of dynamic slicing in locating real faults
Empirical Software Engineering
Locating faulty code by multiple points slicing
Software—Practice & Experience
Tracing lineage beyond relational operators
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Algorithms and tool support for dynamic information flow analysis
Information and Software Technology
Proceedings of the eighteenth international symposium on Software testing and analysis
Dependence clusters in source code
ACM Transactions on Programming Languages and Systems (TOPLAS)
An algorithm for capturing variables dependences in test suites
Journal of Systems and Software
On the computational complexity of dynamic slicing problems for program schemas
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Hi-index | 0.00 |
Different program slicing methods are used for maintenance, reverse engineering, testing and debugging. Slicing algorithms can be classified as static slicing and dynamic slicing methods. In several applications the computation of dynamic slices is more preferable since it can produce more precise results. In this paper we introduce a new forward global method for computing backward dynamic slices of C programs. In parallel to the program execution the algorithm determines the dynamic slices for any program instruction. We also propose a solution for some problems specific to the C language (such as pointers and function calls). The main advantage of our algorithm is that it can be applied to real size C programs, because its memory requirements are proportional to the number of different memory locations used by the program (which is in most cases far smaller than the size of the execution history-which is, in fact, the absolute upper bound of our algorithm).