Citations: and practical investigations of an automatic program abstraction method

57 citations found. Retrieving documents...

M. Weiser, Program slices: formal, psychological, and practical investigations of an automatic program abstraction method, Ph.D. thesis, University of Michigan, Ann Arbor (1979).

Home/Search Document Not in Database Summary Related Articles Check

This paper is cited in the following contexts:

First 50 documents Next 50

A Slicing Approach for Parallel Component Adaptation - Morel, Alexander (2002) (1 citation) (Correct)

....is decomposed into independent sub problems, i.e. FE 4 and GE 4 . P P O O O P2 A B Figure 3. A parallel adaptation architecture Retrieval is performed on the sub problems. The matching components are composed in a parallel architecture. 4. Specification Slicing Program slicing [14] is a decomposition process used to isolate a subset of program behavior. A program slice is a sub program that contains only those statements and variables that affect or are affected by a slicing criterion. A slice criterion is a set of variables that are of interest at some point in the ....

M. Weiser. Program Slices: Formal, Psychological, and Practical Investigations of an Automatic Program Abstraction Method. PhD thesis, University of Michigan, Ann Arbor, MI, 1979.

ConSIT: A Fully Automated Conditioned Program Slicer - Fox, Danicic, Harman, Hierons (2003) (Correct)

....### #####: Conditioned Slicing, program conditioning, slicing, symbolic execution, path analysis INTRODUCTION Program slicing is an automatic program extraction technique in which statements which cannot a#ect a slicing criterion are removed to form a slice. In initial work on slicing [47, 48], the criterion was a program point and set of variables. For this criterion the slice is a (possibly) reduced program which maintains the e#ect of the original on the value of all variables at the program point of interest. This form of slicing has come to be known as static slicing, because the ....

.... check valid means that there was little need for adopting the client server approach that was required with a previous version of C##SIT [14] Architecture of the Slicer The slicer is based on the Parallel Slicing Algorithm [16] which in turn is based on Mark Weiser s original slicing algorithm [47] and is implemented in Java using Espresso, a multi threaded slicer generator [15] Having parsed the object program p, a representation of its Control Flow Graph (CFG) is obtained from a representation of p s abstract syntax. From this CFG a network of concurrent process 2003 John Wiley ....

[Article contains additional citation context not shown here]

Mark Weiser. Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, University of Michigan, Ann Arbor, MI, 1979.

Context-Sensitive Slicing of Concurrent Programs - Krinke (2003) (2 citations) (Correct)

....2. SLICING A slice extracts those statements from a program, that potentially have an influence on a specific statement of interest which is the slicing criterion. Originally, slicing was defined by Weiser in 1979; he presented an approach to compute slices based on iterative data flow analysis [31, 32]. The other main approach to slicing uses reachability analysis in program dependence graphs [8] Program dependence graphs mainly consist of nodes representing the statements of a program and control and data dependence edges: Control dependence between two statement nodes exists if one ....

M. Weiser. Program slices: formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, University of Michigan, Ann Arbor, 1979.

Syntax-Directed Amorphous Slicing - Danicic, Harman, Munro, Binkley.. (Correct)

....amorphous conditioned slice in rightmost column of Figure 28 is obtained. In this way, amorphous slicing may further improve the way in which conditioned slicing helps extract business rules based upon a condition of interest. 9 Related Work Slicing was introduced by Mark Weiser in 1979 [77] and has been the subject of extensive study since then. In 1984 it was shown that intraprocedural slices could be computed eciently 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, ....

....in situations where syntax preservation is unimportant. Several authors have indicated that the syntactic subset requirement of syntax preserving slicing has been a hindrance to the computation of small slices [14, 56] Indeed, in his thesis, Weiser immediately recognized and acknowledged ([77], page 6) that it would not always be possible for a slice to be constructed as a purely faithful subset of the original program s syntax. 25 Many other authors have suggested ways of combining slicing and transformation for a variety of applications including re ning the precision of ....

Mark Weiser. Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, University of Michigan, Ann Arbor, MI, 1979.

Forward Slicing by Partial Evaluation - Vidal (Correct)

....program slicing [33] is a method for decomposing programs by analyzing their data and control ow. It has many applications in the eld of software engineering (e.g. program understanding, maintenance, debugging, merging, testing, code reuse, etc) This concept was originally introduced by Weiser [32] in the context of imperative programs. Surprisingly, there are very few approaches to program slicing in the context of declarative programming (some notable exceptions are, e.g. 13, 21, 24, 25, 29] Roughly speaking, a program slice consists of those program statements which are (potentially) ....

M.D. Weiser. Program Slices: Formal, Psychological, and Practical Investigations of an Automatic Program Abstraction Method. PhD thesis, The University of Michigan, 1979.

Unions of Slices are not Slices - De Lucia, Harman, Hierons, Krinke (2003) (Correct)

....preserve the final value of the variable x. Of course, a particular algorithm for slicing would only produce a single (unique) slice for a single criterion. However, Weiser s definition allows for many possible valid slices. In this example, both slices are minimal (minimal slices are not unique [22]) Observe that the union of the two slices is not a slice on x. This result is interesting from a theoretical point of view, but is less important practically speaking, because, any deterministic algorithm would only construct a single slice for a single criterion and therefore there would be ....

....slices, leads to unions which turn out always to be valid slices, themselves. The paper also suggests some other questions about set operations on slices, which the authors would like to encourage the slicing community to consider, for example: 1. Is the union of two dataflow minimal slices [15, 22] a dataflow minimal slice and, if not, is it even a slice 2. Do results for backward slicing also apply to forward [11] slicing 3. Is the union of chops [12] defined by Chop(s 1 , t 1 ) Chop(s 2 , t 1 ) 1 , t 2 ) 2 , t 2 ) a valid chop on the union of the chopping criteria Chop(s 1 ....

M. Weiser. Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, University of Michigan, Ann Arbor, MI, 1979.

A Denotational Interprocedural Program Slicer - Ouarbya, Danicic, Daoudi (2002) (Correct)

.... and software metrics [3, 30, 34] There are several surveys of slicing techniques, applications and variations [5, 13, 20, 37] Slicing across functions and function calls is complicated due to the problems of side effects that can be generated by an expression [5, 20, 37] Published approaches [12, 28, 40, 41] do not explicitly mention how side effects are handled. The main contribution of this paper is to describe a denotational interprocedural slicing algorithm for programs in the presence of side effects. We only consider end slicing. i.e. the slicing criterion is p; V , where V is the set of ....

WEISER, M. Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, University of Michigan, Ann Arbor, MI, 1979.

A Formal, Language-Independent, and Compositional Approach to.. - Stafford Self-citation (Formal) (Correct)

No context found.

M. Weiser. Program Slices: Formal, Psychological, and Practical Investigations of an Automatic Program Abstraction Method. PhD thesis, University of Michigan, Ann Arbor, Michigan, 1979.

A Formal, Language-Independent, and Compositional Approach to.. - Stafford Self-citation (Formal) (Correct)

.... to deal with the huge amounts of information that exhaustive data ow analysis generates [9] application to other areas of computer science including secure information ow [16] and most important to this dissertation, the application of data ow techniques to software maintenance problems [18, 53]. 2.2.4 1980 1989 The early 1980s saw increasing interest in the area of applying data ow techniques to software maintenance problems. The value of statically analyzing a program for errors that may not reveal themselves until the program has been executed grew in appeal as people realized ....

M. Weiser. Program Slices: Formal, Psychological, and Practical Investigations of an Automatic Program Abstraction Method. PhD thesis, University of Michigan, Ann Arbor, Michigan, 1979.

Effects of Context on Program Slicing - Krinke (2006) (Correct)

No context found.

M. Weiser, Program slices: formal, psychological, and practical investigations of an automatic program abstraction method, Ph.D. thesis, University of Michigan, Ann Arbor (1979).

ConSUS: A Light-Weight Program Conditioner - Sebastian Danicic Mohammed (2004) (Correct)

Program Slicing of Hardware Description Languages - Clarke Fujita Rajan (1999) (11 citations) (Correct)

No context found.

M. Weiser. Program slices: Formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, Universityo f Michigan, 1979. 300

Barrier Slicing and Chopping - Krinke (2003) (2 citations) (Correct)