A Static Program Slicing Approach for Output Stream Objects in JEE Applications

03/14/2018
by   Anas Shatnawi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2018

Neural Program Search: Solving Programming Tasks from Description and Examples

We present a Neural Program Search, an algorithm to generate programs fr...
research
03/28/2019

Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation

We prove that certain formulations of program synthesis and reachability...
research
04/05/2014

MTD(f), A Minimax Algorithm Faster Than NegaScout

MTD(f) is a new minimax search algorithm, simpler and more efficient tha...
research
03/13/2019

SymPas: Symbolic Program Slicing

Program slicing is a technique for simplifying programs by focusing on s...
research
07/15/2019

A Relational Static Semantics for Call Graph Construction

The problem of resolving virtual method and interface calls in object-or...
research
11/09/2022

Dynamic Slicing by On-demand Re-execution

In this paper, we propose a novel approach that aims to offer an alterna...
research
05/22/2017

On the computational complexity of dynamic slicing problems for program schemas

Given a program, a quotient can be obtained from it by deleting zero or ...

Please sign up or login with your details

Forgot password? Click here to reset