This paper presents a context‐sensitive dynamic slicing technique for the concurrent and
aspectized programs. To effectively represent the concurrent aspect‐oriented programs, we …

This paper presents a dynamic parallel context-sensitive slicing algorithm for distributed
AOPs. The context-sensitivity makes the computed slice more precise and accurate. We …

This paper proposes a dynamic slicing algorithm for concurrent feature-oriented programs.
The algorithm is named concurrent feature-oriented node-marking dynamic slicing …

Feature-Oriented Programming (FOP) is a general paradigm for synthesizing programs in
software product lines. A family of software systems constitutes a software product line …

Fault finding is an activity to locate the fault or bug present in a software. It is a very time
taking job and needs much more effort if done manually. Hence, automated fault localisation …

More than 75% of recent Java projects include some form of concurrent programming. Due
to complex interactions between multi-threads, concurrent programs are often harder to …

This paper proposes a technique to compute dynamic slices of feature-oriented programs
with aspect-oriented extensions. The technique uses a dependence based intermediate …

Distributed computing has become very popular these days due to its speed, accuracy and
fault tolerance capability. In this pa-per, we have considered the distributed Aspect-Oriented …

In this paper, we have proposed an algorithm for dynamic slicing of concurrent COPs that
consist of multiple threads. In order to portray the concurrent COP effectively, an …

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 …