T. Gyim othy, A. Besz edes, and I. Forg acs. An efficient relevant slicing method for debugging. In Proc. ESEC/FSE'99 -- 7th European Software Engineering Conference / 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, volume 1687 of LNCS, pages 303--321, Toulouse, France, Sept. 1999. Springer-Verlag.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....is not dramatically smaller than the program itself the program dependencies are too coarse [11] Also, data and control flow analysis of real life programs is non trivial. For programs with pointers, the necessary points to analysis makes dependencies even more coarse [9] Dynamic slicing [3, 7, 13] is a variant of slicing that takes a concrete program run into account. The basic idea is that within a concrete run, one can determine more accurate data dependencies between variables, rather than summarizing them as in static slicing. In the dynamic slice of x # , as above, x # is dependent on ....

T. Gyim othy, A. Besz edes, and I. Forg acs. An efficient relevant slicing method for debugging. In Proc. ESEC/FSE'99 -- 7th European Software Engineering Conference / 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, volume 1687 of LNCS, pages 303--321, Toulouse, France, Sept. 1999. Springer-Verlag.

....Specific invariant checkers have been designed to detect illegal memory usage or array bound violations. By combining slicing with observation, one obtains dynamic slicing: a slice that is valid for a specific execution only, and hence more precise than a slice that applies for all executions [1, 6, 11]. In principle, a dynamic slicing tool does not require source code as long as it can intercept all read write accesses to program state and thus trace actual dependencies. As an example of dynamic slicing, assume that after the execution of the code above, we find that buf contains a = 0 and ....

T. Gyim othy, A. Besz edes, and I. Forg acs. An efficient relevant slicing method for debugging. In Proc. ESEC/FSE'99 -- 7th European Software Engineering Conference / 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, volume 1687 of Lecture Notes in Computer Science, pages 303--321, Toulouse, France, Sept. 1999. Springer-Verlag.

....understood as failure inducing statements during a program execution. The most significant method to determine statements relevant for a failure is program slicing either the static form obtained by program analysis [11] 12] or the dynamic form applied to a specific run of the program [13] [14]. The strength of analysis is that several potential failure causes can be eliminated due to lack of data or control dependency. This does not suffice, though, to check whether the remaining potential causes are relevant or not for producing a given failure. Only by experiment (that is, testing) ....

Tibor Gyimothy, Arpad Beszedes, and Istvan Forgacs, "An efficient relevant slicing method for debugging," In Nierstrasz and Lemoine [15], pp. 303--321.

....algorithm can be classed according to whether they only use static information (static slicing) or dynamic execution information for a specific program input (dynamic slicing) This paper focuses on the dynamic slicing methods. There have many dynamic slicing methods proposed in literature [1, 10, 11, 13, 18]. Most of them can be divided into two categories: forward and backward slicing. There is not much work on slicing object oriented programs (OOPs) until recently [14, 15, 20] and only few concern dynamic methods [17, 26] The main difficulty of dynamic slicing is to obtain the running time ....

....some dependencies might not hold in dynamic execution. Agrawal also proposes a precise method based on the dynamic dependence graph (DDG) 1] and Zhao applies it to slice object oriented programs [26] The shortcoming is that the size of the DDG is unbound. Korel [10] Song [17] and Tibor [18] propose forward dynamic slicing methods and Song also proposes method to slice OOPs using dynamic object relationship diagram (DORD) 17] In these methods, they compute the dynamic slices for each statement immediately after this statement is executed. After the last statement is executed, the ....

[Article contains additional citation context not shown here]

G, Tibor, et al. An Efficient Relevant Slicing Method for Debugging, Software Engineering Notes, Software Engineering ##ESEC/FSE'99 Springer ACM SIGSFT, 1999: 303-321

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC