Weiser83. Weiser, M., Reconstructing sequential behavior from parallel behavior projections, Information Processing Letters 17(5) pp. 129-135 (October 1983).  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... are based on data flow equations [1, 2, 3] while others use graph representations of the program [4, 5, 6, 7, 8, 9, 10] A survey is given elsewhere[11] Applications of program slicing are many and varied[11] including debugging[12, 13] program comparison and integration[14] parallelisation[15, 16], testing[17] and maintenance[18, 19] The traditional definition of slicing is concerned with slicing programs written in imperative programming languages. Two assumptions are implicit in this definition: 1. programs contain variables and statements, and 2. slices consist solely of statements. If ....

M. Weiser, "Reconstructing sequential behavior from parallel behavior projections," Information Processing Letters, vol. 17, pp. 129--135, Oct. 1983.

....a schedulable one. Program Slicing. We have found program slicing a valuable tool for the task transformation problem at hand. Weiser first formulated the definition of program slicing in [40] and presented two of its potential applications in [42] program debugging and parallel program execution [41]. Slicing isolates the statements which (may) affect a value computed at a specific program point exactly the type of exercise which one often pursues in program debugging. Slicing can isolate the flows of control leading to a suspected bug; thus it can help a programmer track down the bug s ....

....slicing as a tool to help convert single threaded programs into parallel ones. The idea is to independently execute several slices in parallel each corresponding to different parts of the program and then to dynamically correlate their outputs in a way that preserves the original semantics [41]. Our task transformation is somewhat influenced by this approach, and it shares the essential code transformation strategy slicing, and then splicing two parts of a program together. But thanks to the sequential nature of our real time tasks, we only need to statically splice the sliced ....

[Article contains additional citation context not shown here]

M. Weiser. Reconstructing sequential behavior from parallel behavior projections. Information Processing Letters, 17(3):129--135, October 1983.

....we are using a division in which none of the parameters are partially static. This is done merely to give the simplest possible example of the differences between BifS and BifS. 18 # Weiser proposed using slicing to decompose programs into separate threads that can be run in parallel [36]. Each thread computes a portion of what is computed by the original program. # Horwitz, Reps, and Prins proposed an algorithm for merging two variants A and B of a program Base [11] The algorithm breaks down Base, A, and B into their constituent slices and chooses among them to create the ....

Weiser, M., "Reconstructing sequential behavior from parallel behavior projections," Information Processing Letters 17 pp. 129-135 (October 1983). - 21 -

....originally discussed by Mark Weiser in [42] allows one to isolate individual computation threads within a program. Slicing can be used for such 16 Chapter 1 diverse activities as helping a programmer understand complicated code, aiding debugging [24] automatically parallelizing programs [41, 4], and automatically combining program variants [14] See [37] for an extensive survey of work on program slicing. The problem of interprocedural slicing concerns how to determine a slice of an entire program, where the slice crosses the boundaries of procedure calls. One algorithm for ....

M. Weiser. Reconstructing sequential behavior from parallel behavior projections. Information Processing Letters, 17:129--135, October 1983.

....point p.This concept, originally discussed by Mark Weiser in [34] allows one to isolate individual computation threads within a program. Slicing can be used for such diverse activities as helping a programmer understand complicated code, aiding debugging [21] automatically parallelizing programs [33,1], and automatically combining program variants [8] In Weiser sterminology,aslicing criterion is a pair p,V , where p is a program point and V is a subset of the program svariables. In his work, a slice consists of all statements and predicates of the program that might affect the values of ....

Weiser,M., "Reconstructing sequential behavior from parallel behavior projections," Information Processing Letters 17 pp. 129-135 (October 1983).

....to be sliced. 1 begin 2 Read(X;Y ) 3 T otal : 0:0; 4 5 if X = 1 6 then 7 else begin 8 9 T otal : X Y ; 10 end; 11 12 end Figure 2: A slice of the program in Figure 1 using the criterion (Total,12) cluding debugging[26, 1] program comparisonand integration[14] parallelisation[27, 5], testing[7] and maintenance[22, 12] The traditional definition of slicing is concerned with slicing programs written in imperative programming languages. Two assumptions are implicit in this definition: 1. programs contain variables and statements, and 2. slices consist solely of statements. If ....

Mark Weiser. Reconstructing sequential behavior from parallel behavior projections. Information Processing Letters, 17:129--135, October 1983.

....third condition is impossible to verify in general, it is feasible to do so for a number of special cases. In general, it is up to the compiler writer to check condition (iii) 6. 6 Other Applications Weiser describes how slicing can be used to parallelize the execution of a sequential program [84]. Several slices of a program are executed in parallel, and the outputs of the slices are spliced together in such a way that the I O behavior of the original program is preserved. In principle, the splicing process may take place in parallel with the execution of the slices. A natural ....

Weiser, M. Reconstructing sequential behavior from parallel behavior projections. Information Processing Letters 17, 3 (1983), 129--135.

....does not account for calling context has the same complexity. 6 Executable slicing Executable slicing transforms one or more programs into object code, either by eliminating parts of a program or by combining multiple programs. When used for testing [LW87, KSF90, PC90, FSKG92] parallelization [Wei83, BW88] or program decomposition [RY88, Bin93] the goal is a smaller, faster program that computes the same slicing criterion values as the original program, but without computing other, irrelevant results. When used for integration of compatible versions of a program [RY89, HPR89, HR90, HRB90, ....

....from linear in the size of the VDG to linear in the size of the source code graph, which is approximately the size of the original program. 8 Related work Weiser introduced the concept of slicing [Wei79, Wei84] and showed its application to debugging [Wei82, LW86, LW87] and parallelization [Wei83, BW88] His slicing criteria consist of a statement and a set of variables not necessarily referenced in the statement, and his slices are syntactically correct subsets of the original program with the same termination behavior. Weiser treats slicing as a dataflow problem and provides an O(ne log ....

Mark Weiser. Reconstructing sequential behavior from parallel behavior projections. Information Processing Letters, 17(5):129--135, October 1983.

....This concept, originally discussed by Mark Weiser in [17] can be used to isolate individual computation threads within a program. Slicing can help a programmer understand complicated code [17] can aid in debugging and software maintenance [7, 8, 12] and can be used for automatic parallelization [2, 16]. Horwitz, Reps, and Binkley identify two different but related slicing problems [9] It is important to understand the distinction between them (the names come from [15] ############################# This work was supported in part by a summer research grant from Loyola College. Author s ....

Weiser, M. "Reconstructing sequential behavior from parallel behavior projections." Information Processing Letters 17(5)(October 1983), 129-135.

No context found.

Weiser83. Weiser, M., Reconstructing sequential behavior from parallel behavior projections, Information Processing Letters 17(5) pp. 129-135 (October 1983).

No context found.

Weiser, M., "Reconstructing sequential behavior from parallel behavior projections," Information Processing Letters 17 pp. 129-135 (1983).

No context found.

Weiser83. Weiser, M., "Reconstructing sequential behavior from parallel behavior projections," Information Processing Letters 17(5) pp. 129-135 (October 1983).

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