G. Canfora, A. Cimitile & A. De Lucia, "Conditioned program slicing," Information and Software Technology Special Issue on Program Slicing 40 (1998), 595--607.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....possible executions. These constraints are the conditions of conditioned slicing. Since the condition could simply be either true or a conjunction of equalities which define the input, it is possible (in theory at least) for conditioned slicing to subsume both static and dynamic forms of slice [7]. For example, suppose the programmer wants to understand the behaviour of the original program when some condition is satisfied, here conditioned slicing will remove parts of the program which cannot have an e#ect when the condition is met. Another possibility is that the program has some ....

....to equilateral disappears. Using the approach described in this paper, these conditions are inserted as assert statements directly into the program source. Thus the programmer can easily see the e#ect of various assumptions about the program, by asserting and slicing . Canfora et al. [7] provide a survey of work on conditioned slicing. Korel and Rilling [38] provide a survey of dynamic slicing. More general surveys of slicing can be found in papers by Tip [45] Binkley and Gallagher [4] and De Lucia [18] 2003 John Wiley Sons, Ltd. Softw. Pract. Exper. if (a= b) if (a= b) if ....

[Article contains additional citation context not shown here]

Gerardo Canfora, Aniello Cimitile, and Andrea De Lucia. Conditioned program slicing. In Mark Harman and Keith Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595--607. Elsevier Science B. V., 1998. 2003 John Wiley & Sons, Ltd. Softw. Pract. Exper.

....the exponential expansion of expressions kicks in with a consequent impact on time complexity. Any such exponential expression expansion will therefore require careful monitoring and action to avoid unacceptable performance implications. 8 Amorphous Conditioned Slicing Conditioned slicing [13, 19, 25], is a variation of traditional slicing in which the slicing criterion is augmented by a condition. Statements and predicates which cannot a ect the values of the variables of interest when the condition is satis ed are removed to form the conditioned slice. A conditioned slice can be thought of ....

.... [50] In 1991 the dynamic slicing criterion was extended to the quasi static criterion [72] and in 1995 dynamic, static and quasi static criteria were brought within a single generic conditioned [25] or constrained [29] criterion, which subsumes static, dynamic and quasi static criteria [13]. In all these approaches to slicing, the only simplifying transformation used to create slices was statement deletion. This choice was motivated by the original application of slicing to debugging, where the syntaxpreserving nature of a slice was important. However, the restriction to statement ....

Gerardo Canfora, Aniello Cimitile, and Andrea De Lucia. Conditioned program slicing. In Mark Harman and Keith Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595-607. Elsevier Science B. V., 1998.

....preserved during slicing is re cast as a parameter to the de nition of a slice. This allows for di erent interpretations and de nitions of the way in which slicing is to behave. The framework is suciently general to allow the de nition of dynamic [Korel and Laski, 1988] and conditioned slices [Canfora et al. 1998]. Because the syntax preserving semantic equivalence relation is parameterized by V and i, De nition 9 describes a class of relations based upon the choice of V and i. This re ects the fact that each slicing criterion yields a slice which respects a di erent projection of the semantics of the ....

Canfora, G., Cimitile, A., and De Lucia, A. (1998). Conditioned program slicing. In Harman, M. and Gallagher, K., editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595-607. Elsevier Science B. V.

.... integration of two different versions of a program [16] It also forms part of approaches to decompilation [5, 6] and has been put forward as part of a tool assisted approach to program comprehension [2, 10, 12] This paper is concerned with a variation of slicing called conditioned slicing [3, 13]. Conditioned slicing forms a theoretical bridge between the two extremes of static and dynamic slicing. It augments the traditional slicing criterion with a condition which captures a set of initial program states of interest. This additional condition can be used to simplify the program before ....

....in WSLwas the many available transformations in FermaT. The ability to simplify conditions is important for any conditioned slicer. An obvious solution is to use an existing theorem prover; previous approaches to conditioned slicing either used this approach or suggested that it should be used [3, 9]. Unfortunately, the use of a theorem prover can impose a large overhead in both memory and CPU time. The theorems of relevance in ConSUS typically involve inequalities over arithmetic expressions. There may be techniques that are more appropriate for these kinds of theorems than general purpose ....

G. Canfora, A. Cimitile, and A. De Lucia. Conditioned program slicing. In M. Harman and K. Gallagher, editors, Information and Software Technology Special Issue on Program 9 Slicing, volume 40, pages 595--607. Elsevier Science B. V., 1998.

....process at any point and see the result produced so far . This partial result is guaranteed to be a valid amorphous slice, but simply may not be as small as that which could be achieved with a little more patience. 5 Mixing amorphous slicing with program conditioning Conditioned slicing [3, 4, 6], is a variation of traditional slicing in which the slicing criterion is augmented by a condition. Statements and predicates which cannot a ect the values of the variables of interest when the condition is satis ed are removed to form the conditioned slice. A conditioned slice can be thought of ....

Gerardo Canfora, Aniello Cimitile, and Andrea De Lucia. Conditioned program slicing. In Mark Harman and Keith Gallagher, editors, Information and This comes `for free' as a by product of the dependence reduction transformation rules. Software Technology Special Issue on Program Slicing, volume 40, pages 595-607. Elsevier Science B. V., 1998.

....added to PDG DS if the edge does not exist yet. When v is defined at s, C(v) is updated to the node for s.Wedo this for all variables in s. For an array or a structured variable, we prepare caches for each element of the variable. For example, for an array variable A that has ten elements A[1] A[2], A[10] we prepare caches C(A[1] C(A[2] C(A[10] When a pointer variable p is used in a statement s,we must consider not only p,butp #. Thus, direct and indirect references must be contained in PDG DS as data dependence edges; i.e. C(p) # p s and C(p # p# s. Also, in the ....

....When v is defined at s, C(v) is updated to the node for s.Wedo this for all variables in s. For an array or a structured variable, we prepare caches for each element of the variable. For example, for an array variable A that has ten elements A[1] A[2] A[10] we prepare caches C(A[1] C(A[2]) C(A[10] When a pointer variable p is used in a statement s,we must consider not only p,butp #. Thus, direct and indirect references must be contained in PDG DS as data dependence edges; i.e. C(p) # p s and C(p # p# s. Also, in the case of indirect assignment with a pointer ....

[Article contains additional citation context not shown here]

Canfora, G., Cimitile, A., and De Lucia, A.: "Conditioned Program Slicing", Information and Software Technology, vol. 40, no. 11/12, November 1998, pp. 595-607.

.... consists of identifying the parts of a program that can potentially affect the values of a chosen set of variables [6, 14, 20, 36, 44] There are various forms of slicing including the original static formulation [43] and subsequent dynamic [1, 27] quasi static [38] conditioned and constrained [7, 10, 18] and pre post conditioned [21] Slices can be construed to be syntax preserving or amorphous [5, 19, 40] The problem of computing static variable dependence can be partly solved by a solution to the corresponding static slicing question. This result can be used in order to determine control ....

CANFORA, G., CIMITILE, A., AND DE LUCIA, A. Conditioned program slicing. In Information and Software Technology Special Issue on Program Slicing, M. Harman and K. Gallagher, Eds., vol. 40. Elsevier Science B. V., 1998, pp. 595--607. 9

....of producing slices of the full range of C programming language features in reasonable time. Adapting such tools to the dynamic memory problem is therefore attractive. Conditioned and amorphous slicing technology is comparatively newer and less mature than the syntax preserving counterpart [4, 7, 11]. However, the (semi automatically produced) conditioned amorphous slices we were able to construct in this case study suggest that the combination of amorphous and conditioned slicing will be a very useful tool for dynamic memory analysis. The rest of this paper is organised as follows: Section ....

....the diff DMM slice had ve separate and distinct behaviours, determined by the command line parameter switches provided by the user. It therefore seemed appropriate to consider the behaviour of the program in isolation, for each of these ve behaviours. This is a simple form of conditioned slicing [4, 13]. A conditioned slice is constructed with respect to an augmented slicing criterion, which additionally contains a predicate which determines an initial condition of interest [4] Statements which cannot be executed when this condition is satis ed are removed, in a process called conditioning. ....

[Article contains additional citation context not shown here]

Gerardo Canfora, Aniello Cimitile, and Andrea De Lucia. Conditioned program slicing. In Mark Harman and Keith Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595-607. Elsevier Science B. V., 1998.

....large and complex programs; FermaT implements a large number of powerful program transformations, these combined with syntactic slicing make it possible to use FermaT for general conditioned semantic slicing. 7 Slicing Example The following WSL program is a translation of the C program in [6]: 8 posprod : 1; negprod : 1; then possum : possum a; posprod : posprod a elsif a 0 then negsum : negsum a; negprod : negprod ( a) elsif test0 = 1 then if possum # negsum then possum : 0 else negsum : 0 fi; then posprod : 1 else negprod : 1 fi fi; then ....

G. Canfora, A. Cimitile & A. De Lucia, "Conditioned program slicing," Information and Software Technology Special Issue on Program Slicing 40 (1998), 595--607.

....affect the values of variables in V at n are removed to form the slice. For example, consider the program in section (a) of Figure 2. Slicing this program with respect to the criterion (fxg; 8) yields the slice in section (b) Conditioned slicing was introduced by Canfora, Cimitile and De Lucia [7, 14, 15]. It forms a bridge between the two extremes of static and dynamic analysis. It augments the traditional static slicing criterion with a condition which captures a set of initial program states of interest. This allows a programmer to further specialize a program by eliminating statements which do ....

....assignment to Ct. In this case there is only one. The procedure is sliced with the condition Ct 0 Ct Thresh immediately after the assignment to Ct and the pre condition Ct 0 Ct =Thresh. Slicing on this criterion yields the fragment in Figure 4. Implementations of conditioned slicing [14, 7] construct conditioned slices in terms of path conditions. The ConSIT implementation [14] also simplifies these path conditions using the Isabelle theorem prover [43, 42] This can be useful in examining the conditions which could lead to an exception (such as the one captured by the value of Ct ....

CANFORA, G., CIMITILE, A., AND DE LUCIA, A. Conditioned program slicing. In Information and Software Technology Special Issue on Program Slicing, M. Harman and K. Gallagher, Eds., vol. 40. Elsevier Science B. V., 1998, pp. 595--607.

No context found.

G. Canfora, A. Cimitile, and A. De Lucia. Conditioned program slicing. In M. Harman and K. Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595--607. Elsevier Science B. V., 1998.

....dynamic slicing algorithms whenever the dependent statement does not affect the computation of the variable of interest and then is lost in the union of the dynamic slices too. The same problem is likely to affect other forms of slicing, such as quasi static slicing [21] and conditioned slicing [3], where slices are constructed with respect to a subset of the execution traces . Therefore, to build valid unions for forms of slices computed with respect to subsets of execution traces, we need to consider other properties than just preserving program dependences. It is likely that the ....

G. Canfora, A. Cimitile, and A. De Lucia. Conditioned program slicing. In M. Harman and K. Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595--607. Elsevier Science B. V., 1998.

....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 methods together with algorithms and applications to software engineering. The paper ....

....to identify the set of source code statements implementing a functionality. Combining slicing with this approach results in a more precise identification of the functionality to be extracted. 6 Conditioned slicing Conditioned slicing is a general framework for statement deletion based slicing [14]. A conditioned slice consists of a subset of program statements which preserves the behavior of the original program with respect to a slicing criterion for any set of program executions. The set of initial states of the program that characterize these executions is specified in terms of a first ....

[Article contains additional citation context not shown here]

G. Canfora, A. Cimitile, and A. De Lucia, "Conditioned program slicing", Information and Software Technology, vol. 40, no. 11/12, 1998, pp. 595-607.

No context found.

G. Canfora, A. Cimitile & A. De Lucia, "Conditioned program slicing," Information and Software Technology Special Issue on Program Slicing 40 (1998), 595--607.

No context found.

G. Canfora, A. Cimitile & A. De Lucia, "Conditioned program slicing," Information and Software Technology Special Issue on Program Slicing 40 (1998), 595--607.

No context found.

G. Canfora, A. Cimitile, and A. De Lucia. Conditioned program slicing. In Mark Harman and Keith Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595-607. Elsevier Science B. V., 1998.

No context found.

G. Canfora, A. Cimitile, and A. DeLucia, "Conditioned Program Slicing," Information and Software Technology, special issue on program slicing, M. Harman and K. Gallagher, eds., vol. 40, pp. 595-607, 1998.

No context found.

G. Canfora, A. Cimitile, and A. De Lucia. Conditioned program slicing. In M. Harman and K. Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595--607. Elsevier Science B. V., 1998.

No context found.

G. Canfora, A. Cimitile, and A. De Lucia. Conditioned program slicing. In M. Harman and K. Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595--607. Elsevier Science B. V., 1998.

No context found.

G. Canfora, A. Cimitile, and A. De Lucia, "Conditioned Program Slicing," Information and Software Technology Special Issue on Program Slicing, M. Harman and K. Gallagher, eds., vol. 40, pp. 595-607, 1998.

No context found.

G. Canfora, A. Cimitile, and A. De Lucia. Conditioned program slicing. In M. Harman and K. Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595--607. Elsevier Science B. V., 1998.

No context found.

G. Canfora, A. Cimitile, A. De Lucia, Conditioned program slicing, in: M. Harman, K. Gallagher (Eds.), Information and Software Technology Special Issue on Program Slicing, Vol. 40, Elsevier Science B. V., 1998, pp. 595--607.

No context found.

G. Canfora, A. Cimitile, and A. De Lucia. Conditioned program slicing. In M. Harman and K. Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595-607. Elsevier Science B. V., 1998.

No context found.

Gerardo Canfora, Aniello Cimitile, and Andrea De Lucia. Conditioned program slicing. In Mark Harman and Keith Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 595-607. Elsevier Science B. V., 1998.

No context found.

G. Canfora, A. Cimitile, A. De Lucia, Conditioned program slicing, in: M. Harman, K. Gallagher (Eds.), Information and Software Technology Special Issue on Program Slicing, Vol. 40, Elsevier Science B. V., 1998, pp. 595--607.

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