.png){kind=icon}
.png){kind=icon}
Return
Dynamic slicing of distributed Aspect-Oriented Programs: A context-sensitive approach
.png){kind=icon}
PRE
AI
DOI：10.1016/j.csi.2017.01.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 slider 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.
Keywords:
Program slicing
Context-sensitive
Aspect-Oriented Programming
Distributed Aspect-Oriented Programs
Dynamic slicing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.1
Papers:
2.3K
Citations:
2.0K