Please use this identifier to cite or link to this item:
Title: Dynamic slicing of aspect-oriented programs
Authors: Mohapatra, D P
Sahu, M
Kumar, R
Mall, R
Keywords: Aspect-oriented programming
Dynamic aspect-oriented dependence graph (DADG)
Dynamic dependence slicing tool (DDST)
Program slice
Trace file based dynamic slicing (TBDS) algorithm
Issue Date: 2008
Publisher: Jožef Stefan Institute in Ljubljana
Citation: Informatica (Ljubljana), Vol 32, Iss 3, P 261-274
Abstract: Program slicing is a decomposition technique which has many applications in various software engineering activities such as program debugging, testing, maintenance etc. Aspect-oriented programming (AOP) is a new programming paradigm that enables modular implementation of cross-cutting concerns such as exception handling, security, synchronization, logging etc. The unique features of AOP such as join-point, advice, aspect, introduction etc. pose difficulties for slicing of AOPs. We propose a dynamic slicing algorithm for aspect-oriented programs. Our algorithm uses a dependence-based representation called Dynamic Aspect-Oriented Dependence Graph (DADG) as the intermediate program representation. The DADG is an arc-classified digraph which represents various dynamic dependences between the statements of the aspect-oriented program. We have used a trace file to store the execution history of the program. We have developed a tool called Dynamic Depenedence Slicing Tool (DDST) to implement our algorithm. We have tested our algorithm on many programs for 40-50 runs. The resulting dynamic slice is precise as we create a node in the DADG for each occurrence of the statement in the execution trace.
Description: Copyright for the paper belongs to the Informatica
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
dpm-2008.pdf261.99 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.