An Efficient Relevant Slicing Method for Debugging

Gyimóthy, Tibor; Beszedes, Arpad; Forgács, István

doi:10.1007/3-540-48166-4_19

Cited by 35 publications

(39 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has been observed (Agrawal et al, 1993b;Gyimothy et al, 1999) that in some situations faulty statements are not captured by full slices. Consider the following faulty version of a program.…”

Section: Relevant Slicingmentioning

confidence: 96%

“…& Relevant slicing. While relevant slices also consider data and control dependences, in addition, they include predicates that actually did not affect the output but could have affected it had they been evaluated differently, direct data dependences of these predicates, and chains of dynamic data and control dependences of these direct data dependences (Agrawal et al, 1993b;Gyimothy et al, 1999).…”

mentioning

confidence: 99%

See 1 more Smart Citation

A study of effectiveness of dynamic slicing in locating real faults

Zhang

Gupta

2006

Empir Software Eng

View full text Add to dashboard Cite

Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic slicing for locating real faults present in programs have been carried out. In this paper we study the effectiveness of fault location using dynamic slicing for a set of real bugs reported in some widely used software programs. Our results show that of the 19 faults studied, 12 faults were captured by data slices, 7 required the use of full slices, and none of them required the use of relevant slices. Moreover, it was observed that dynamic slicing considerably reduced the subset of program statements that needed to be examined to locate faulty statements. Interestingly, we observed that all of the memory bugs in the faulty versions were captured by data slices. The dynamic slices that captured faulty code included 0.45 to 63.18% of statements that were executed at least once.

show abstract

Section: Relevant Slicingmentioning

confidence: 96%

mentioning

confidence: 99%

A study of effectiveness of dynamic slicing in locating real faults

Zhang

Gupta

2006

Empir Software Eng

View full text Add to dashboard Cite

show abstract

“…In our proposed transformation, since the addFlow method adds DynSlice of s to DynSlice of x when recording the influence of a statement s on a variable x, DynFlow would identify statements that implicitly influence a given variable; i.e., it would compute relevant slices that are similar to what is described in [3,16,53].…”

Section: Transformation Algorithmmentioning

confidence: 96%

“…Finally, they proposed that coverage of relevant slices involving certain (limited) code changes be used as a basis for test suite reduction in regression testing. Gyimothy et al [16] presented an earlier version of the algorithm in [4] that also computes relevant slices; it is based on extending Program Dependence Graphs (PDGs). This forward-computing algorithm is strictly intra-procedural and handles only scalar variables and structured code.…”

Section: Related Workmentioning

confidence: 99%

“…Thus, our proposed extension to our DIFA approach to detecting implicit flows (Section 8) is related to the aforementioned work on relevant slices. Our extension uses program transformations and, as in [16], it uses a forward-computing algorithm, but it can additionally handle inter-procedural flows, unstructured constructs, and control statements involving objects and array references.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation