Computing Dynamic Slices of Feature-Oriented Programs with Aspect-Oriented Extensions

This paper proposes a technique to compute dynamic slices of feature-oriented programs with aspectoriented extensions. The technique uses a dependence based intermediate program representation called composite feature-aspect dependence graph (CFADG) to represent feature-oriented software that contai...

Full description

Saved in:
Bibliographic Details
Published in:Informatica (Ljubljana) Vol. 44; no. 2; pp. 199 - 224
Main Author: Sahu, Madhusmita
Format: Journal Article
Language:English
Published: Ljubljana Slovenian Society Informatika / Slovensko drustvo Informatika 01.06.2020
Subjects:
Algorithms
C plus plus
Dependence
Graphical representations
Java
Language
Marking
Nodes
Product lines
Run time (computers)
Slicing
Software
ISSN:0350-5596, 1854-3871
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes a technique to compute dynamic slices of feature-oriented programs with aspectoriented extensions. The technique uses a dependence based intermediate program representation called composite feature-aspect dependence graph (CFADG) to represent feature-oriented software that contain aspects. The CFADG of a feature-oriented program is based on the selected features that are composed to form a software product and the selected aspects to be weaved. The proposed dynamic slicing technique has been named feature-aspect node-marking dynamic slicing (FANMDS) algorithm. The proposed feature-aspect node marking dynamic slicing algorithm is based on marking and unmarking the executed nodes in the CFADG suitably during run-time. The advantage of the proposed approach is that no trace ñle is used to store the execution history. Also, the approach does not create any additional nodes during run-time.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0350-5596
1854-3871
DOI:10.31449/inf.v44i2.2452