A Node-Marking Technique for Dynamic Slicing of Aspect-Oriented Programs

Abstract

We propose an efficient dynamic slicing technique for aspect-oriented programs. We use a dependencebased intermediate program representation called extended aspect-oriented system dependence graph (EASDG) to represent aspect-oriented software. The EASDG of an aspect-oriented program consists of a system dependence graph (SDG) for non-aspect code, a group of dependence graphs for aspect code and some additional dependence edges used to connect the system dependence graph for non-aspect code to the dependence graphs for aspect code. Our dynamic slicing algorithm is based on marking and unmarking of the executed nodes in EASDG appropriately during run-time. In our approach, we do not use any trace file to store the execution history. Also, our approach does not create any additional nodes during run-time. We use the term node and vertex interchangeably in this paper.

A unique aspect-oriented program slicing technique

“…Sahu et al [12] has overcome some of the faults of Zhao by computing dynamic slices and adding a new type of edge i.e " Weaving Edge" into the EASDG. But her approach does not compute an executable slice.…”

“…Sahu et al [12] constructed the Extended-ASDG as the intermediate representation of Aspect-oriented programs. Their EASDG differs from the ASDG of Zhao [9] in two ways: each point-cut in the AspectJ program is shown explicitly and also the weaving process is represented in EASDG.…”

“…5) Compute the slice for aspect part: To find the slice w.r.t. any point-cut or any slicing point in aspect part, we can apply backward slicing algorithms like node marking slicing algorithm [12], on the SDG created in step-1. It will give the slice of total AO program w.r.t.…”

“…Step a: Apply Node Marking Dynamic Slicing(NMDS) algorithm [12] to find the slice of the non-aspect part. Store the statement numbers in the slice in an array.…”

Dynamic slicing of concurrent AspectJ programs: An explicit context‐sensitive approach

“…In our approach, we use the previously available information of the MAODG for computing the slices of CAOPs. For computing the slices of CAOPS Ray et al have extended the existing Node Marking‐unmarking algorithm for OOPs proposed by Mohapatra et al to CAOPs. Our slicing technique is based on context sensitivity.…”