Dynamic slicing of distributed Aspect-Oriented Programs: A context-sensitive approach

This paper presents a dynamic parallel context-sensitive slicing algorithm for distributed AOPs. The context-sensitivity makes the computed slice more precise and accurate. We introduce parallelism in our algorithm to make slice computation faster. We have developed a tool called D-AspectJ slicer to compute dynamic slices for distributed AOPs. The proposed slicing technique is compared with two other related existing techniques using ten case studies. The experimentation shows that our proposed slicing algorithm generates smaller slices in less time as compared to other two existing algorithms. •Proposed a suitable intermediate graph for representation of the features of distributed AOP.•Proposed a dynamic context-sensitive parallel algorithm for finding the precise slices of distributed AOPs, in less time.•Developed an automated tool for graph generation and slice computation.•Comparison of performance of our proposed approach with the similar existing approaches.