A Static Program Slicing Approach for Output Stream Objects in JEE Applications
Anas Shatnawi, Hafedh Mili, Manel Abdellatif, Jean Privat, Yann-Ga\"el, Gu\'eh\'eneuc, Naouel Moha, Ghizlane El Boussaidi
TL;DR
This paper presents a static program slicing method for output stream objects in JEE applications, utilizing dependency call graphs from KDM models and a BFS algorithm, implemented in the DeJEE tool.
Contribution
It introduces a novel static slicing technique for JEE output streams based on dependency graphs and graph reachability analysis.
Findings
Effective in isolating relevant code segments for output streams.
Implemented as an extension of the DeJEE tool for practical use.
Enhances understanding and debugging of JEE applications.
Abstract
In this paper, we propose a program slicing approach for the output stream object in JEE applications. Our approach is based on extracting a dependency call graph from KDM models of JEE applications. Then, it applies breath-first search algorithm to identify the program slice as a graph reachability problem. The proposed approach is implemented as an extension of our DeJEE tool.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.