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

Singh, Jagannath; Mohapatra, Durga Prasad

doi:10.1002/spe.2520

Cited by 7 publications

(3 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Context-sensitive dynamic slicing (Singh and Mohapatra, 2018) is applied on the sample program to improve the performance of fault localisation. A sliced program is computed from the fixed slicing criteria.…”

Section: Sample Experimentsmentioning

confidence: 99%

A dynamic slicing-based approach for effective SBFL technique

Ghosh

Singh

2021

IJCSE

Self Cite

View full text Add to dashboard Cite

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 is always in high demand which reduces the human effort and also makes the task more accurate. Among different existing debugging techniques, spectrum-based debugging is the most efficient for automated fault localisation. Dynamic program slicing is another technique which can reduce the debugging time by reducing the unaffected source codes depending on slicing criteria. In this paper, we present a spectrum-based fault localisation technique by using dynamic slicing. Context-sensitive slicing is used to diminish fault localisation time and makes the process more effective. SBFL metrics are used in the sliced program to find the suspiciousness score of individual program statements. The efficiency of the proposed approach is evaluated on three open-source programs. From results, we notice that due to dynamic slicing the technique takes less time to find the suspiciousness score of individual statements in the sliced program compared to original program. We have also observed that the programmer needs to inspect less source code to detect the buggy statement. The result says that the proposed approach outperforms the pure spectrum-based fault localisation techniques.

show abstract

Section: Sample Experimentsmentioning

confidence: 99%

A dynamic slicing-based approach for effective SBFL technique

Ghosh

Singh

2021

IJCSE

Self Cite

View full text Add to dashboard Cite

show abstract

“…Therefore, most of the slicing-based fault location techniques use different slices ( Zhang, Gupta & Zhang, 2004 ), execution slices ( Xu et al, 2011 ) to locate faults in order to minimize the scope of suspicious statements. Singh & Mohapatra (2018) presented a context-sensitive dynamic slicing technique for concurrent programs. To effectively represent the concurrent aspect-oriented programs, Singh & Mohapatra (2018) proposed an intermediate graph called the multithreaded aspect-oriented dependence graph.…”

Section: Introductionmentioning

confidence: 99%

“… Singh & Mohapatra (2018) presented a context-sensitive dynamic slicing technique for concurrent programs. To effectively represent the concurrent aspect-oriented programs, Singh & Mohapatra (2018) proposed an intermediate graph called the multithreaded aspect-oriented dependence graph. Li & Orso (2020) presented a technique that computes memory-address dependence and represents them on standard dynamic dependence graphs for better supporting software debugging.…”

Section: Introductionmentioning

confidence: 99%

The improved dynamic slicing for spectrum-based fault localization

Cao

Wang

Deng

et al. 2022

PeerJ Computer Science

View full text Add to dashboard Cite

Background Spectrum-based Fault localization have proven to be useful in the process of software testing and debugging. However, how to improve the effectiveness of software fault localization has always been a research hot spot in the field of software engineering. Dynamic slicing can extract program dependencies under certain conditions. Thus, this technology is expected to benefit for locating fault. Methods We propose an improved dynamic slicing for spectrum-based fault localization under a general framework. We first obtain the dynamic slice of program execution. Secondly, we construct a mixed slice spectrum matrix from the dynamic slice of each test case and the corresponding test results. Finally, we compute the suspiciousness value of each statement in the mixed-slice spectram matrix. Results To verify the performance of our method, we conduct an empirical study on 15 widely used open-source programs. Experimental results show that our approach achieves significant improvement than the compared techniques. Conclusions Our approach can reduce approximately 1% to 17.79% of the average cost of code examined significantly.

show abstract