G. A. Venkatesh. The semantic approach to program slicing. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 107-- 119, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... using the Program Dependence Graph [61] This result was extended to interprocedural slicing in 1988 [47, 48] Also in 1988, the rst non static slicing criterion, the dynamic slicing criterion, was introduced [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 ....

Guda A. Venkatesh. The semantic approach to program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 26-28, Toronto, Canada, June 1991.

....used in the partial evaluation community [21] Furthermore, partial evaluation assumes the availability of positive information, whereas ocs requires derivation of both positive and negative information. Another area of research that is closely related to the idea of ocs is program slicing [25, 24, 6]. Some recent work in this area has focused on deriving program slices based on post conditions, such as p slicing [7] P slicing does not state any requirement for the correctness of program slices in the situation when input does not satisfy the wpc of a program with respect to the ....

G. A. Venkatesh. The semantic approach to program slicing. In ACM SIGPLAN Conf. on Programming Language Design and Implementation, volume 26(6), pages 107-119. ACM Press, June 1991.

....are lost in current 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 ....

G. A. Venkatesh. The semantic approach to program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 26--28, Toronto, Canada, June 1991.

....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 methods together with ....

.... maintenance [54, 60] and program comprehension [59] A survey and comparison of dynamic slicing methods has been presented by Korel and Rilling [61] 4 Quasi static slicing Quasi static slicing was the first attempt to define a hybrid slicing method ranging between static and dynamic slicing [83]. The need for quasi static slicing arises from applications where the value of some input variables is fixed while the behavior of the program must be analyzed when other input values vary. Indeed, a quasi static slice preserves the behavior of the original program with respect to the variables ....

G.A. Venkatesh, "The semantic approach to program slicing", ACM SIGPLAN Notices, vol. 26, no. 6, 1991, pp. 107-119.

....The original formulation of slicing [24] was static. That is, the slicing criterion contained no information about the input to the program. Later work on slicing created different paradigms for slicing including dynamic slicing [1, 17] for which the input is known) and quasi static slicing [19] (for which an input prefix is known) The way in which slicing produces an executable subprogram, based upon some criterion of interest, gives rise to applications in re engineering. For example, slicing has been suggested as a tool for the integration of two different versions of a program ....

G. A. Venkatesh. The semantic approach to program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 26--28, Toronto, Canada, June 1991.

.... Analysis Program slicing 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 ....

VENKATESH, G. A. The semantic approach to program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation (Toronto, Canada, June 1991.

....may have to be re designed altogether. In this paper we present a static alternative to this process, which is based on two inter related components: a real time annotation language called TCEL [11] for Time Constrained Event Language ) and the compiler transformation known as program slicing [28, 36, 37]. Surprisingly, while our use of static slicing often leads to longer execution times and even higher utilizations it simultaneously helps achieve real time correctness and schedulability for the entire system. For this reason we call the transformation real time task slicing. The Language of ....

G. Venkatesh. The semantic approach to program slicing. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, June 1991.

....and Tightness metric in his master s thesis [7] and his work has been considerably developed by Ott and Thuss [12, 8, 16] who introduce the notion of the cohesive section and of metric slice . A metric slice, is the union of the conventional (backward) slice, with the corresponding forward slice [17] constructed for the same criterion. A forward slice is the set of statements which are affected by the slicing criterion. Ott and Thuss claim that the use of metric slices leads to cohesion metrics which are less sensitive to minor program changes than those based upon the backward slice alone. ....

Guda A. Venkatesh. The semantic approach to program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 26--28, Toronto, Canada, June

....presented may be generalised to the more general case in which the line number may be any node of interest in the program s CFG. The original definition of program slice given by Weiser [18] and its subsequent modifications by Korel and Laski [10] for the dynamic paradigm) and by Venkatesh [17] and Tip [15] for the quasi static paradigm) share the property that a slice is to be constructed by statement deletion, and that the slice should preserve a projection of the original program s semantics. The motivation for slicing derives from the fact that the slice of a program is (usually) ....

Guda A. Venkatesh. The semantic approach to program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 26--28, Toronto, Canada, June

....S : That is, the conditioned equivalence relation is a weaker equivalence relation than the static equivalence relation. Also, in the limiting case where S is the set of all states 8K; i:T (K;i) C (K;i) S : A similar argument demonstrates that conditioned slicing subsumes Venkatesh s [29] quasi static slice. Traditional static slicing often creates little simplification in practice. For example, consider the program in Figure 2. If a static slice is constructed for the variable z at the end of the program, then the smallest possible static slice an algorithm may construct, ....

Venkatesh, G. A. The semantic approach to program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation (Toronto, Canada, June

.... n t ] containing v t a value number for the value of interest used primarily to avoid inserting redundant code for equivalent computations c t the slice an AST sequence of statements required to recompute the desired sequence of values (c t resembles a dynamic backward executable slice [25]) t t the target a location in P where c t can safely be placed without changing the meaning of P i t the identifier of a local index array which, after execution of c t , will contain the sequence of subscript values indicated by v t d t a set of AST indices of subscripts on which the ....

G. A. Venkatesh. The semantic approach to program slicing. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 107--119, June 1991. 21

....based on data flow and control flow analysis. According to Weiser, a program slice with respect to a program point and a variable consists of all statements and predicates of the program that might a#ect the value of the variable at the point in question. Program slices have di#erent categories [107]. For example, a forward slice consists of statements that are a#ected by the variable in question [50] Thus, the original definition of a program slice [109] can be called a backward slice [107] In object identification, program slicing can be used, for example, if a procedural routine should ....

....a#ect the value of the variable at the point in question. Program slices have di#erent categories [107] For example, a forward slice consists of statements that are a#ected by the variable in question [50] Thus, the original definition of a program slice [109] can be called a backward slice [107]. In object identification, program slicing can be used, for example, if a procedural routine should belong to several objects (classes) in object oriented code. Each slice of the routine can be attached to a separate class. 3.2.2 Re engineering tools Many di#erent tools supporting ....

[Article contains additional citation context not shown here]

Venkatesh, G. A., The semantic approach to program slicing, Proceedings of the ACM Conference on Programming Language Design and Implementation (SIGPLAN'91), Toronto, Canada, June 1991, Sigplan Notices 26 (6) 1991, 107--119.

.... semantic change analysis of software [Bur90, BR90, CR88, CK84, MR90a, MR91, PS89, Ryd83, RP88, YRLS97, YRL99] interprocedural def use relations [PLR94, HS94, GH98, CR99, Cha99] and e#ective static interprocedural program slicing [GL91, HRB90, OO84, RR95, GS96, LH96, HC98, SHR99, TCFR96, Tip96, Ven91, Wei84, TAFM97, AG96, AG98] Many of these key applications in parallel and sequential programming environments need interprocedural def use information. Interprocedural side e#ect information can be used to approximate definitions; a similar calculation can approximate interprocedural variable ....

....GH98, Ruf95, HP98, SH97a, ZRL98, ZRL96] This is often used as an empirical test of the precision of the alias solution obtained. Related Analyses Related interprocedural analyses include compile time interprocedural program slicing [GL91, HRB90, OO84, RR95, GS96, LH96, HC98, SHR99, TCFR96, Tip96, Ven91, Wei84, TAFM97, AG96, AG98] interprocedural def use associations [PLR94, HS94, GH98, CR99] and, demand analyses [HRS95, DGS95, DGS96] Slicing determines the data and control dependent parts of a program which correspond to a particular computation. Def use associations trace value flow on ....

G. A. Venkatesh. The semantic approach to program slicing. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 107--119, June 1991.

....[25] 3. Information flow relation based Bergeretti and Carr e s model of a slice in terms of information flow relations derived from a program using a syntax directed approach [2] 4. Denotational semantics based influenced by the use of denotational semantics to express program analyzers [31]. This definition is slightly different from the original definition of program slice introduced by Weiser [33] 1 July 27, 1999 In all, but the graph reachability based approaches, what constitutes a program slice may be modelled declaratively as a system of equations (more generally, ....

G. A. Venkatesh. The semantic approach to program slicing. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 107--119, 1991.

No context found.

G. A. Venkatesh. The semantic approach to program slicing. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 107-- 119, 1991.

No context found.

G. A. Venkatesh. The semantic approach to program slicing. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 107--119, 1991.

No context found.

G. A. Venkatesh. The semantics approach to program slicing. In Brent Hailpern, ed., Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, Toronto, Ontario, pp 107-119, 26-28 June 1991, IEEE Society Press, Los Alamitos, CA.

No context found.

G. A. Venkatesh. The semantic approach to program slicing. In ACM [2], pages 107--119.

No context found.

G.A. Venkatesh, "The Semantic Approach to Program Slicing," Proc. of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 107-119, June 1991.

No context found.

G.A. Venkatesh. The Semantic Approach to Program Slicing. SIGPLAN Notices, 26(6):107--119, 1991. Proc. of the ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI'91).

No context found.

G. A. Venkatesh. The semantic approach to program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 26--28, Toronto, Canada, June 1991.

No context found.

G. A. Venkatesh. The semantic approach to program slicing. ACM SIGPLAN Notices, 26(6):107--119, 1991.

No context found.

G. A. Venkatesh. The semantic approach to program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 26--28, Toronto, Canada, June 1991.

No context found.

G. A. Venkatesh. The semantic approach to program slicing. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 26-28, Toronto, Canada, June 1991.

No context found.

G. A. Venkatesh, `The semantic approach to program slicing', Proc. SIGPLAN'91 Conference on Programming Language Design and Implementation, Toronto, Ontario, Canada, June 1991. ACM Press. SIGPLAN Notices, 26, (6), 107--119 (1991).

First 50 documents  Next 50

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