An Approach for Computing Dynamic Slice of Concurrent Aspect-Oriented Programs
| Autor: | Ray, Abhishek, Mishra, Siba, Mohapatra, Durga Prasad |
|---|---|
| Rok vydání: | 2014 |
| Předmět: | |
| Zdroj: | International Journal of Software Engineering and Its Applications, Vol. 7, No. 1, January, 2013 |
| Druh dokumentu: | Working Paper |
| Popis: | We propose a dynamic slicing algorithm to compute the slice of concurrent aspect-oriented programs. We use a dependence based intermediate program representation called Concurrent Aspect-oriented System Dependence Graph (CASDG) to represent a concurrent aspect-oriented program. The CASDG of an aspect-oriented program consists of a system dependence graph (SDG) for the non-aspect code, a group of dependence graphs for aspect code and some additional dependence edges used to connect the system dependence graph for the non-aspect code to dependence graph for aspect code. The proposed dynamic slicing al-gorithm is an extended version of NMDS algorithm for concurrent object-oriented programs, which is based on marking and unmarking of the executed nodes in CASDG appropriately during run-time. Comment: 20 pages. arXiv admin note: text overlap with arXiv:1403.0100 |
| Databáze: | arXiv |
| Externí odkaz: |
|