Information Processing Letters
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Slicing object-oriented software
Proceedings of the 18th international conference on Software engineering
Programmers use slices when debugging
Communications of the ACM
Slicing concurrent java programs
ACM SIGPLAN Notices
An efficient method for computing dynamic program slices
Information Processing Letters
Slicing Concurrent Java Programs
IWPC '99 Proceedings of the 7th International Workshop on Program Comprehension
A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems
International Journal of Information and Communication Technology
Hi-index | 0.00 |
Program slicing has many applications such as program debugging, testing and maintenance We propose a new dynamic slicing technique for distributed object-oriented programs We introduce the notion of Distributed Program Dependence Graph (DPDG) Our dynamic slicing technique uses DPDG as the intermediate program representation and is based on marking and unmarking the edges in the DPDG as and when the dependencies arise and cease during run-time Our approach eliminates the use of trace files and is more efficient than the existing algorithms.