Using Program Slicing in Software Maintenance
IEEE Transactions on Software Engineering
Debugging with dynamic slicing and backtracking
Software—Practice & Experience
Generalized algorithmic debugging and testing
ACM Letters on Programming Languages and Systems (LOPLAS)
Selecting tests and identifying test coverage requirements for modified software
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Program and interface slicing for reverse engineering
ICSE '93 Proceedings of the 15th international conference on Software Engineering
An efficient relevant slicing method for debugging
ESEC/FSE-7 Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Dynamic Slicing Method for Maintenance of Large C Programs
CSMR '01 Proceedings of the Fifth European Conference on Software Maintenance and Reengineering
A brief survey of program slicing
ACM SIGSOFT Software Engineering Notes
Algorithms and tool support for dynamic information flow analysis
Information and Software Technology
An algorithm for capturing variables dependences in test suites
Journal of Systems and Software
Hi-index | 0.00 |
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithrms can be classified as a static slicing or dynamic slicing type. In applications such as debugging the computation of dynamic slices is more preferable since it can produce more precise results. In a recent paper [5] a new so-called "forward computed dynamic slice" algorithm was introduced. It has the great advantage compared to other dynamic slice algorithms that the memory requirements of this algorithm are proportional to the number of different memory locations used by the program, which in most cases is much smaller than the size of the execution history. The execution time of the algorithm is linear in the size of the execution history. In this paper we introduce the handling of pointers and the jump statements (goto, break, continue) in the C language.