B. Korel and J. Laski. Dynamic slicing of computer programs. Journal of Systems and Software, 13(3):187-- 195, 1990.  Home/Search   Document Not in Database   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 ....

B. Korel and J. Laski. Dynamic slicing of computer programs. The Journal of Systems and Software, 13(3):187--195, Nov. 1990.

....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 ....

B. Korel and J. Laski. Dynamic slicing of computer programs. The Journal of Systems and Software, 13(3):187-- 195, Nov. 1990.

....of statements. A slice is an executable subset of program statements that preserves the original behavior of the program with respect to a subset of variables of interest and at a given program point. Several variants of this notion have been proposed in the literature, such as dynamic slicing [58], quasi static slicing [83] simultaneous dynamic slicing [37] and conditioned slicing [14] Forms of slicing that are based on amore general framework of transformations, including the simple statement deletion, have also been proposed [39] This paper discusses statement deletion based slicing ....

....produced an unexpected result on some input to the program. However, a static slice may very often contain statements which have no influence on the values of the variables of interest for the particular execution in which the anomalous behavior of the program was discovered. Korel and Lasky [57, 58] proposed an alternative slicing definition, namely dynamic slicing, which uses dynamic analysis to identify all and only the statements that affect the variables of interest on the particular anomalous execution trace. In this way, the size of the slice can be considerably reduced, thus allowing ....

[Article contains additional citation context not shown here]

B. Korel and J. Laski, "Dynamic slicing of computer programs", The Journal of Systems and Software, vol. 13, no. 3, 1990, pp. 187-195.

....architecture slices. The feasibility and the expected benefits of the approach is demonstrated through a study of part of an electronic commerce system and a run time execution of its architecture using a tool. The notion of DSAS draws on earlier work on dynamic program slicing techniques [17, 1, 10, 9] and static software architecture slicing techniques [20, 16] While a static slice is determined independently of the input at compile time, a dynamic slice is determined according to a particular input at run time, hence smaller in size than its static counterpart. In contrast to a program slice ....

.... [Korel86] Agrawal90] Type [Stafford98] Zhao97] Horwitz90] Dynamic Forward Architecture [Song99] Korel94] Table 2 Categories of related work The concept of program slicing was first proposed by Weiser [19] and later extended by Agrawal, Hogan [1] Korel and Laski [9] to dynamic program slicing so as to identify unique dynamic behavior of a program under a given input with respect to some variable of interest. Korel and Yalamanchili [10] proposed a way of computing program slices namely, forward dynamic program slicing that doesn t require the construction of ....

B. Korel and J. Laski, "Dynamic Slicing of Computer Programs", Journal of Systems Software, 1990, pp. 187--195.

....by observing execution behavior for dynamic slicing. The dynamic slicing approach can be used to approximate static slices by constructing a union of program slices for each variable in the program over a large number of test runs [14] Different dynamic slicing methods are introduced in e.g. [10], 1] In [1] Agrawal and Horgan presented a precise dynamic slicing method, which is based on the graph representation of the dynamic dependences. This graph, called Dynamic Dependence Graph (DDG) includes a distinct vertex for each occurrence of a statement. A dynamic slice created from the DDG ....

....we compute and store the set of statements that affect the currently executed instruction. This way we avoid any superfluous information (which may be unbounded) Prior to the desciption of the algorithm some basic concepts and notations are overviewed and introduced. For clarity we rely on [10] but in some cases the necessary modifications have been made. We demonstrate our concepts for dynamic slicing by applying them on the example program in Figure 1. We apply a program representation which considers only the definition and the use of variables and, in addition, it considers direct ....

B. Korel and J. Laski. Dynamic slicing in computer programs. The Journal of Systems and Software, 13(3):187-- 195, 1990.

....(V) at the program point (s) A static slice is computed by static dependence analysis without making assumptions regarding a program s input and therefore is valid for all possible executions of the program. Dynamic slicing of Programs was originally introduced by Korel and Laski in 1988 [14, 15]. In the case of dynamic slicing of programs, unlike the case of static slicing of programs where all dependences that occur in all possible executions of the program are considered, only the dependences that occur in a specific execution of the program are taken into account. There are some ....

....where all dependences that occur in all possible executions of the program are considered, only the dependences that occur in a specific execution of the program are taken into account. There are some different definitions for the notion of dynamic slice proposed based on different motivations [1 5, 8, 12 15, 19]. Originally, Korel and Laski defined a dynamic slice (of a sequential program) as an executable part of the program whose behavior is identical to that of the original program with respect to a subset of variables of interest and at execution position q. 14] Agrawal and Horgan defined a ....

B. Korel and J. Laski, "Dynamic Slicing of Computer Programs," The Journal of Systems Software, Vol. 13, pp. 187-195, 1990.

....but only to the intermediate, generated, C program. Using the approach of origin tracking, the generated C constructs will have the original preprocessor directives as origins. Program slicing. A recently introduced notion in the area of debugging and testing is that of a dynamic program slice [KL90, AH90, KSF92] A dynamic program slice is that part of the program that actually determines the value of a given variable at a given occurrence in a program. Clearly, origins describe to some extent a similar notion. We will investigate how these notions are related and whether it is possible ....

B. Korel and J. Laski. Dynamic slicing of computer programs. Journal of Systems and Software, 13:187--195, 1990.

....is regarded as the most common activity during the life time of the program. Hypotheses , at the code, algorithmic and application domain levels, are major drivers to program understanding in the corrective maintenance activities [24, 4, 14] Program slicing, both static [25, 8] and dynamic [13, 10, 1], is also a technique often used in maintenance activities such as comprehension, design recovery and risk migration. The technique was further used to identify functionalities [9] Determining slicing criteria [7] was achieved using symbolic execution [11] Another important issue in managing ....

B. Korel and J. Laski. Dynamic Slicing of Computer Program. The Journal of Systems and Software, 1990.

.... Animator sifts through all the communication between modules to find the subset that is going to or coming from the active module(s) it is a Program Slicing tool as originally defined by Weiser [Weiser81] and extensively explored by others for debugging, testing, and reengineering programs[Agrawal93, Beck93, Gallagher91, Horwitz89, Korel90, and Musa93]. However, because it operates at the architecture rather than the program level, it differs markedly from this work. First, the intellectual core of those efforts are the identification and isolation of a minimal (according to some definition) subset of the program that influenced (or might have ....

Korel, B., and Laski, J. Dynamic Slicing of Computer Programs. Journal of Systems Software 13:187-195 1990

....scenario is the result of the state changes C = # 1 , # n induced by the executed statements. Applying delta debugging to minimize C means to isolate exactly those state changes that were relevant in producing the final state very much like well known dynamic slicing techniques [1, 4, 7], but relying on partial execution rather than analysis of control and data flow and thus showing real causality instead of potential causality. As an example, consider the following PERL program. It reads in two numbers a and b and computes the sum sum = # b i =a i as well as the product ....

B. Korel and J. Laski. Dynamic slicing of computer programs. The Journal of Systems and Software, 13(3):187--195, Nov. 1990.

....is the initial assignment to the variable a. The program slice will thus consist of these two statements. The part of the program that is included in the slice is set in bold typeface in the figure. Extensive descriptions of slicing algorithms can be found in papers by Weiser [Wei84] Korel [KL88, KL90], Horwitz, Reps and Binkley [HRB88, HRB90] Agrawal [AH90, Agr91] and Kamkar [KSF92, Kam93] Main proc(7) proc(8) Figure 5. An example of an execution tree. PROGRAM AnotherExample(input,output) BEGIN a: 3; b: 7; write(b) b: a 3; END. Figure 6. A program slice for C= b: a 3, b . 6 ....

Bogdan Korel and Janusz Laski. Dynamic Slicing of Computer Programs. The Journal of Systems and Software, 13:187--195, 1990.

.... L 2 :pos 1 = 3 k B 3 :pos = L 3 :pos = 3 k B 3 :val = 2 B 3 :pos = 2 3 k L 3 :val = B 3 :val R k L 2 :val = L 3 :val B 3 :val s 1 s 2 Figure 4: Slice partitioning a statement s in a program is a set of all the statements upon which s depends, directly or indirectly [5]. In attribute grammars, attribute evaluation of a given parse tree can be considered to be a sequence of evaluation of node attributes, and we can de ne dynamic program slices for a given attribute grammar description and its input program. For example, the sequence on the right side in Fig. 4 is ....

B. Korel and J. Laski. Dynamic slicing of computer programs. J. System Software, 13:187-195, 1990.

....the results of these computations may be different yet not point to an error. For example, if the order of summation is different on these machines, then rounding errors may produce different results. For this reason, we do not consider different target machines in this context. Program slicing [4, 7, 5, 8] attempts to solve the inverse problem: given a breakpoint (and possibly a variable) find all parts of the program that were executed on the path(s) leading to this breakpoint. If the programmer has selected a specific variable, the slicing debugger may also highlight those parts of the program ....

B. Korel and J. Laski. Dynamic slicing of computer programs. J. Systems and Software, 13(3):187--195, Nov 1990.

....that revealed the error, not under any generic test case. Therefore, dynamic slicing methods are more appropriate than static ones. By using a dynamic slice many statements can be ignored in the process of localizing a bug. Different dynamic slicing methods for debugging are introduced in e.g. [12], 11] 3] In [3] Agrawal and Horgan presented a precise dynamic slicing method which is based on the graph representation of the dynamic dependences. This graph, called a Dynamic Dependence Graph (DDG) includes a distinct vertex for each occurrence of a statement. A dynamic slice created from ....

....that is a pair (i; j) which is written down as i j , where i is the serial number of the instruction at the execution position j. For example 8 7 is the action for the output statement of our example for the same input above. The first precise definition of dynamic slices can be found in [12]. In that paper Korel and Laski defined dynamic slice as an executable program which can be created from the original program by deleting some statements. It is required that for a given input the dynamic slice compute the same values as the original program for a variable v at some selected ....

[Article contains additional citation context not shown here]

Korel, B., and Laski, J. Dynamic slicing in computer programs. The Journal of Systems and Software vol. 13, No. 3, 1990, pp. 187-195.

No context found.

B. Korel and J. Laski. Dynamic slicing of computer programs. Journal of Systems and Software, 13(3):187-- 195, 1990.

No context found.

B. Korel and J. Laski. Dynamic slicing of computer programs. Journal of Systems and Software, 13(3):187--195, November 1990.

No context found.

B. Korel and J. Laski. Dynamic slicing in computer programs. The Journal of Systems and Software, 13(3):187-- 195, 1990.

No context found.

B. Korel and J. Laski. Dynamic slicing in computer programs. The Journal of Systems and Software, 13(3):187-- 195, 1990.

No context found.

B. Korel and J. Laski. Dynamic slicing in computer programs. Journal of Systems Software, 13(3):187--95, 1990.

No context found.

B. Korel and J. Laski. Dynamic slicing of computer programs. Journal of Systems and Software, 13(3):187-- 195, 1990.

No context found.

B. Korel and J. Laski. Dynamic slicing in computer programs. Journal of Systems Software, 13(3):187--95, 1990.

No context found.

B. Korel and J. Laski. Dynamic slicing in computer programs. Journal of Systems Software, 13(3):187--95, 1990.

No context found.

Bogdan Korel and Janusz Laski, `Dynamic slicing of computer programs', J. Systems and Software, 13(3), 187--195 (1990).

No context found.

Bogdan Korel, Janusz Laski, "Dynamic Slicing of Computer Programs", J. Systems Software 1990.

No context found.

Bogdan Korel and Janusz Laski. Dynamic slicing of computer programs. Journal of Systems Software, 13:187--195, 1990.

First 50 documents

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