DocumentCode :
3658655
Title :
Automated Slicing of Aspect-Oriented Programs Using Bytecode Analysis
Author :
Dishant Munjal;Jagannath Singh;Subhrakanta Panda;Durga Prasad Mohapatra
Author_Institution :
Dept. of CSE, NIT Rourkela, Rourkela, India
Volume :
2
fYear :
2015
fDate :
7/1/2015 12:00:00 AM
Firstpage :
191
Lastpage :
199
Abstract :
Program slicing has numerous applications in software engineering activities like debugging, testing, maintenance, model checking etc. The main objective of this paper is to automate the generation of System Dependency Graphs (SDG) for aspect-oriented programs to efficiently compute accurate slices. The construction of SDG is automated by analysing the byte code of aspect-oriented programs that incorporates the representation of aspect-oriented features. After constructing the SDG, we propose a slicing algorithm that uses the intermediate graph and computes slices for a given AOP. To implement our proposed slicing technique, we have developed a prototype tool that takes an AOP as input and compute its slices using our proposed slicing algorithm. To evaluate our proposed technique, we have considered some case studies by taking open source projects. The comparative study of our proposed slicing algorithm with some existing algorithms show that our approach is an efficient and scalable approach of slicing for different applications with respect to aspect-oriented programs.
Keywords :
"Weaving","Algorithm design and analysis","Debugging","Complexity theory","Programming","Heuristic algorithms","Computers"
Publisher :
ieee
Conference_Titel :
Computer Software and Applications Conference (COMPSAC), 2015 IEEE 39th Annual
Electronic_ISBN :
0730-3157
Type :
conf
DOI :
10.1109/COMPSAC.2015.98
Filename :
7273618
Link To Document :
بازگشت