A unique aspect-oriented program slicing technique

Singh, Jagannath; Mohapatra, Durga Prasad

doi:10.1109/icacci.2013.6637164

Cited by 6 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, they proposed a three-phase slicing algorithm to compute static slices using the intermediate graph for a given aspectoriented program. All the above works [4,8,9,10,11] have not considered web applications.…”

Section: Comparison With Related Workmentioning

confidence: 98%

Forward Dynamic Slicing of Web Applications

Sahu

Mohapatra

2016

SIGSOFT Softw. Eng. Notes

Self Cite

View full text Add to dashboard Cite

We present a technique to compute dynamic slices for web applications using forward slicing approach. In our work, we have considered JSP (JavaServer Pages) based web applications. The slicing technique can efficiently be applied using an intermediate representation of a web application. We have proposed a graph called Web Dependence Graph (WDG) as the intermediate representation to correctly represent web applications. We have named our technique Web Application Forward Dynamic Slicing (WAFDS) Algorithm. The WAFDS algorithm first constructs the WDG. Then, the web application is executed for a given input, specified in slicing criteria, and the nodes in WDG resembling the executed statements are marked. Finally, the WDG is traversed in forward direction only along the marked nodes. The traversal is started from the desired point specified in the slicing criterion. The statements corresponding to the traversed marked nodes constitute the required dynamic slice for the given slicing criterion. During traversal along the marked nodes, the dynamic slice at each node is computed. Thus, for a given slicing criterion, the dynamic slice can be obtained in O(1) time.

show abstract

Section: Comparison With Related Workmentioning

confidence: 98%

Forward Dynamic Slicing of Web Applications

Sahu

Mohapatra

2016

SIGSOFT Softw. Eng. Notes

Self Cite

View full text Add to dashboard Cite

show abstract

“…Several works have been carried out on slicing of procedure-oriented programs [34,32,33,30,47], objectoriented programs [11,21,39,22,15], aspect-oriented programs [37,9,10,16,18,23]. But very, few work have been carried out on slicing of feature-oriented programs [35].…”

Section: Comparison With Related Workmentioning

confidence: 99%

“…They had not shown the actual parameters in the pointcuts. Singh et al [18] proposed a method to compute slices depending upon the slice point location in the program. Their computed slice was an executable slice.…”

Section: Comparison With Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

Sahu¹

2020

IJCAI

View full text Add to dashboard Cite

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 file is used to store the execution history. Also, the approach does not create any additional nodes during run-time.Povzetek: Prispevek predstavlja izvirni pristop pri programiranju na osnovi sprejemljivk z aspektno orientiranimi podaljški. Gre za računanje dinamičnih odsekov omenjenih programov.

show abstract

“…There are several approaches available for slicing of AOPs, but there is a scarcity of slicing techniques for CAOPs. In this paper, we propose a context‐sensitive dynamic slicing algorithm for CAOPs.…”

Section: Context‐sensitive Dynamic Slicingmentioning

confidence: 99%

Dynamic slicing of concurrent AspectJ programs: An explicit context‐sensitive approach

Singh

Mohapatra

2017

Softw Pract Exp

Self Cite

View full text Add to dashboard Cite

SummaryThis paper presents a context-sensitive dynamic slicing technique for the concurrent and aspectized programs. To effectively represent the concurrent aspect-oriented programs, we propose an intermediate graph called the multithreaded aspect-oriented dependence graph (MAODG). The MAODG is a dynamic graph generated from the execution trace of a given program with respect to a particular set of values given as an input. Interference dependencies between the statements are shown by a distinguished edge called the interference dependence edge in the MAODG. Based on this intermediate representation, we propose a precise and accurate dynamic slicing algorithm for the concurrent aspect-oriented programs implemented using AspectJ. The proposed dynamic slicing algorithm is implemented in a slicing tool developed using the ASM framework. Several open source programs are studied and evaluated using the proposed technique along with some existing techniques. The experimentation shows that our proposed slicing algorithm generates slices of the same or smaller size, as compared with the existing algorithms. Furthermore, we found that the slice computation time is significantly less in our proposed algorithm, as compared with the existing algorithms.

show abstract

A unique aspect-oriented program slicing technique

Cited by 6 publications

References 12 publications

Forward Dynamic Slicing of Web Applications

Forward Dynamic Slicing of Web Applications

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

Dynamic slicing of concurrent AspectJ programs: An explicit context‐sensitive approach

Contact Info

Product

Resources

About