A study of effectiveness of dynamic slicing in locating real faults

Zhang, Xiangyu; Gupta, Neelam; Gupta, Rajiv

doi:10.1007/s10664-006-9007-3

Cited by 63 publications

(44 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, SFL using BS adopts stronger semantics to evaluate the correlation between statements and failures compared to SFL using code coverage. In addition, it has been demonstrated that BS is effective to capture the influence of the execution of a statement on the output and can locate a wide spectrum of faults [13], that is, BS is generally and strongly correlated with the output of a test case. That is the reason why SFL using BS shows the highest fault localization effectiveness among the four SFL techniques.…”

Section: • Er1: Sfl(fcandbs)mentioning

confidence: 99%

The Impact of Information Richness on Fault Localization

Lei

Zhang

et al. 2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARY Many recent studies have focused on leveraging rich information types to increase useful information for improving fault localization effectiveness. However, they rarely investigate the impact of information richness on fault localization to give guidance on how to enrich information for improving localization effectiveness. This paper presents the first systematic study to fill this void. Our study chooses four representative information types and investigates the relationship between their richness and the localization effectiveness. The results show that information richness related to frequency execution count involves a high risk of degrading the localization effectiveness, and backward slice is effective in improving localization effectiveness.

show abstract

Section: • Er1: Sfl(fcandbs)mentioning

confidence: 99%

The Impact of Information Richness on Fault Localization

Lei

Zhang

et al. 2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…In contrast, most later work on dynamic slicing 'defines' dynamic slicing based on the algorithms used to compute it (e.g., Agrawal et al [1] and Demillo et al [16]). Although many research prototypes and approaches exist [2], [6], [7], [36], [42], [53], [54], all approaches are for a single specific programming language whereas the observation based nature of ORBS allows it to slice programs distracted from multiple programming languages [10].…”

Section: Rq3: Observational Sensitivity To Inadequate Testingmentioning

confidence: 99%

ORBS and the limits of static slicing

Binkley

Gold

Harman

et al. 2015

2015 IEEE 15th International Working Conference on Source Code Analysis and Manipulation (SCAM)

View full text Add to dashboard Cite

Abstract-Observation-based slicing is a recently-introduced, language-independent, slicing technique based on the dependencies observable from program behaviour. Due to the wellknown limits of dynamic analysis, we may only compute an under-approximation of the true observation-based slice. However, because the observation-based slice captures all possible dependence that can be observed, even such approximations can yield insight into the limitations of static slicing. For example, a static slice, S that is strictly smaller than the corresponding observation based slice is guaranteed to be unsafe. We present the results of three sets of experiments on 12 different programs, including benchmarks and larger programs, which investigate the relationship between static and observation-based slicing. We show that, in extreme cases, observation-based slices can find the true static minimal slice, where static techniques cannot. For more typical cases, our results illustrate the potential for observation-based slicing to highlight unsafe static slices. Finally, we report on the sensitivity of observation-based slicing to test quality.

show abstract

“…It has been shown that dynamic program slicing [1,16] can help discover faults [28], but the computational effort is enormous. We have not yet investigated the possible performance gains (reduction of complexity) made possible by the special setting of unit testing, but expect that it will make it more tractable.…”

Section: Related Workmentioning

confidence: 99%

Towards Raising the Failure of Unit Tests to the Level of Compiler-Reported Errors

Steimann

Eichstädt-Engelen

Schaaf³

2008

Objects, Components, Models and Patterns

View full text Add to dashboard Cite

Abstract. Running unit tests suites with contemporary tools such as JUNIT can show the presence of bugs, but not their locations. This is different from checking a program with a compiler, which always points the programmer to the most likely causes of the errors it detects. We argue that there is enough information in test suites and the programs under test to exclude many locations in the source as reasons for the failure of test cases, and further to rank the remaining locations according to derived evidence of their faultiness. We present a framework for the management of fault locators whose error diagnoses are based on data about a program and its test cases, especially as collected during test runs, and demonstrate that it is capable of performing reasonably well using a couple of simple fault locators in different evaluation scenarios.

show abstract

A study of effectiveness of dynamic slicing in locating real faults

Cited by 63 publications

References 23 publications

The Impact of Information Richness on Fault Localization

The Impact of Information Richness on Fault Localization

ORBS and the limits of static slicing

Towards Raising the Failure of Unit Tests to the Level of Compiler-Reported Errors

Contact Info

Product

Resources

About