Abstract
We propose a new dynamic slicing technique for object-oriented programs that is more efficient than the related algorithms. We use an extended system dependence graph (ESDG) as the intermediate program representation. Our dynamic slicing algorithm is based on marking and unmarking the edges in the ESDG as and when dependencies arise and cease during runtime
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have