This paper proposes a Dynamic Graph (DG) traversal slicing algorithm for computing dynamic slices of objectoriented programs in presence of inheritance. The computed dynamic slice can facilitate various software engineering activities like program comprehension, testing, debugging, reverse engineering maintenance etc. This paper first proposes an intermediate program Dynamic Graph (DG) to represent the execution trace of an objectoriented program. Then the proposed slicing algorithm is applied on the intermediate program representation to compute the dynamic slices. The advantage of this approach is that, the intermediate program representation is manageable as it is created on the execution trace, hence needs less memory to store and less time to traverse. The proposed algorithm is space as well as time efficient and computes precise dynamic slices.
展开▼
