2007•Unpublished venueRequires access

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

Madhusmita Sahu, Durga Prasad Mohapatra

Abstract

We propose an efficient dynamic slicing technique for aspect-oriented programs. We use a dependence- based 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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Slicing, Computer science, Program slicing, Aspect-oriented programming, TRACE (psycholinguistics), Graph, Call graph, Code (set theory)