A Static Program Slicing Approach for Output Stream Objects in JEE Applications
This work addresses a domain-specific issue for developers working with JEE applications, but it appears incremental as it builds on existing tools and methods.
The paper tackles the problem of program slicing for output stream objects in JEE applications by proposing an approach based on extracting dependency call graphs from KDM models and applying a breadth-first search algorithm, implemented as an extension of the DeJEE tool.
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.