M. G. Burke and B. G. Ryder. A Critical Analysis of Incremental Iterative Data Flow Analysis Algorithms. IEEE Transactions on Software Engineering, 16(7):723--728, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....instance will not be obtained unless some su#cient conditions are met [RMP88] Pollock and So#a [PS89] present precise incremental iterative algorithms, using change classification and reinitialization, for bitvector problems. A comparison of these incremental iterative algorithms is found in [BR90] For the reference parameter aliasing problem of Fortran like languages, Marlowe and Ryder [MR91] incrementalized Cooper s exhaustive algorithm [Coo85] by applying their incremental framework, which will be briefly explained later. 3.4 Marlowe Ryder Hybrid Algorithm The hybrid data flow analysis ....

....of the Approximate Interprocedural May Alias problem. 4. 2 Overview of the Incremental Aliasing Algorithm When a change is made to the program, an incremental algorithm based on the iterative technique usually has the following two phases in order to obtain the incrementally precise solution [BR90, RMP88] 1. Reinitialize the solution at potentially a#ected program points, 2. Restart iteration from those potentially a#ected program nodes. That is, before restarting iteration, a reinitialization of the region of the program to which the e#ects of a source change can extend, typically called ....

M. Burke and B. G. Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7), July 1990. 95

....and repair are freely interleaved with restructuring, more general incremental and lazy flow analysis are necessary to increase performance substantially. There is now a significant effort in the compiler and programming environments community to incrementalize flow analysis [Burke 90] Burke Ryder 90] Ryder Paull 88] Finally, even if poor performance remains a detriment in the future, the flow computation is precisely the kind of effort necessary to assure a given restructuring preserves meaning, but it is more time consuming and difficult for the engineer than the computer. When the ....

M. Burke and B. G. Ryder. A critical analysis of incremental iterative data-flow algorithms. IEEE Transactions on Software Engineering, SE16 (7), July 1990.

....from scratch, but by removing the effects of that relation. This is more difficult than it sounds due to alias analysis dependence on its own information; if we have a statement p= r; does the relation q,r no longer exist now that p= q; is removed (Incremental analyses are discussed in [BR90, PS89] As our alias analyses are not incremental, if a statement is found to be unexecutable, the alias analysis starts from nothing (i.e. throw away all current alias information) and recompute all aliases ignoring the unexecutable statement. 28 It is interesting to note that alias analysis ....

Michael Burke and Barbara Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7):723--728, July 1990.

.... the CAST version of the simplest elimination algorithm, Allen Cocke interval analysis [AC77] it is also very similar to the algorithm in [Bur90] Although elimination algorithms are generally considered more efficient than iterative algorithms, they are also harder to understand and implement [BR90] This is due to the analysis required to reveal the structure in the flow graph, as well as the bookkeeping required to manipulate the flow graph according to this structure. In contrast, Algorithm F Flow suffers from none of these drawbacks: it does not need to compute intervals, since these ....

M. Burke and B. G. Ryder. A critical analysis of incremental iterative data-flow algorithms. IEEE Transactions on Software Engineering, 16(7), July 1990.

....incrementally, and we know of no case in which a complex incremental algorithm has been analyzed for average case complexity. For some domains, it may be possible to compare the utility of incremental algorithms considering their performance for the types of inputs that are most likely to occur [BR90] There have also been a few attempts to demonstrate the utility of incremental algorithms by comparing their performance on random data, versus starting over from scratch; see [Car88, RLP90] While it has often been suggested that a better empirical test would be based on data collected from ....

M. Burke and B. G. Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7), July 1990. 110

....changes in the circuit. This type of methodology is necessary for concurrent engineering techniques in which ATPG proceeds concurrently with design. Even though incremental techniques have been introduced in many other fields such as logic simulation [16, 17, 18, 19, 20] or data flow analysis [21, 22], incremental concepts for test generation have been discussed in just two recent publications [23, 24] The first paper deals with generating tests for faults based on tests generated for other faults in the same circuit, and the second paper deals with generating tests for larger circuits based ....

M. Burke and B. Ryder, "A Critical Analysis of Incremental Iterative Data Flow Analysis Algorithms," IEEE Trans. on Software Engineering, vol. 16, no. 7, pp. 723--728, July 1990.

.... 1 Introduction There are two classical approaches to incremental data flow analysis: one based on iteration methods [PS89] and another based on elimination methods [RP88, CR88] Marlowe and others have extensively studied the relative merits of one approach over the other [Mar89, RMP88, MR90, BR90] Marlowe has also proposed a hybrid scheme that combines the two approaches [MR90, Mar89] In this paper we propose a new approach for incremental data flow analysis that is based on our eager elimination method [SGL95a] Compared to previous elimination based incremental data flow analyses, our ....

Burke, M. G., and Ryder, B. G. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7):723-- 728, July 1990.

.... side e#ects is crucial for aggressive compiler optimization [ASU86] practical dependence analysis in programs with procedure calls [Ban88, Pol88, Wol89] data flow based testing [HS91, BH93, HFGO94, Ost90, Wey94, CR99, FW93, FI98] incremental 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 ....

M. Burke and B. G. Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7), July 1990.

....instance will not be obtained unless some su#cient conditions are met [RMP88] Pollock and So#a [PS89] present precise incremental iterative algorithms, using change classification and reinitialization, for bitvector problems. A comparison of these incremental iterative algorithms is found in [BR90] For the reference parameter aliasing problem of Fortran like languages, e#cient flow insensitive algorithms are proposed in [Coo85] Marlowe and Ryder [MR91] incrementalize these algorithms by applying their incremental framework. The incremental pointer aliasing problem for C is more ....

....in the solution of the Approximate Interprocedural May Alias problem. 4 INCREMENTAL ALIASING ANALYSIS When a change is made to the program, an incremental algorithm based on the iterative technique usually has the following two phases in order to obtain the incrementally precise 3 solution [BR90, RMP88] 1. Reinitialize the solution at potentially a#ected program points, 2. Restart iteration from those potentially a#ected program nodes. That is, before restarting iteration, a reinitialization of the region of the program to which the e#ects of a source change can extend, typically ....

M. Burke and B. G. Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7), July 1990.

....inform ation at program po int n w ith reaching alias RA Figure 1: Decomposition of the MOD problem present precise incremental iterative algorithms, using change classification and reinitialization, for bitvector problems. A comparison of these incremental iterative algorithms is found in [BR90]. The incremental hybrid algorithm [MR90] handles changes by combining the elimination and iteration methods. A hybrid incremental algorithm for the reference parameter aliasing problem of Fortran is proposed in [MR91] For the MOD problem for Fortran like languages, e# cient flow insensitive ....

M. Burke and B. G. Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7), July 1990.

....in the solution of the Approximate Interprocedural May Alias problem. 4 INCREMENTAL ALIASING ANALYSIS When a change is made to the program, an incremental algorithm based on the iterative technique usually has the following two phases in order to obtain the incrementally precise 4 solution [BR90, RMP88] reinitialize the solution at potentially a#ected program points, and restart iteration. That is, before restarting iteration, a reinitialization of the region of the program to which the e#ects of a source change can extend, typically called the a#ected region, is taken to retain a safe ....

M. Burke and B. G. Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7), July 1990.

....the discipline, so that relations between analysis approaches are better understood. This requires us to accept as research contributions, efforts to show common elements in various analyses, to unify their nomenclature, and to compare effectiveness[Ryder and Paull 1986; Marlowe and Ryder 1990; Burke and Ryder 1990]. Even within communities, there are often multiple meanings for the same term, such as flow sensitivity[Marlowe et al. 1995] It is most important, for example, to have both the abstract interpretation [Cousot and Cousot 1977] and data flow analysis communities achieve better mutual understanding ....

Burke, M. and Ryder, B. G. 1990. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering 16, 7 (July).

....schema for MODC and describes new and extensive empirical results with two of the algorithms. The first MODC algorithm in the schema was discussed in [LRZ93] Ban88, Pol88, Wol89] data flow based testing [HS91, BH93, Ost90, Wey94] incremental semantic change analysis of software [Bur90, BR90, CK84, MR90a, PS89, Ryd83, RP88] interprocedural def use relations [PLR94, HS94, GH98] and effective static interprocedural program slicing [GL91, HRB90, OO84, RR95, GS96, LH96, TCFR96, Tip96, Ven91, Wei84, TAFM97, AG96] Many of these key applications in parallel and sequential programming ....

M. Burke and B. G. Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7), July 1990.

....alias analysis like ours, the size of the solution at a particular point during iteration will not decrease. A fixed point solution is obtained when, for a given iteration, it does not increase at any program point. Monotonicity can be lost with incremental analysis for arbitrary program changes [5]. For example, a statement can be inserted that, by killing some aliases, decreases the number of aliases reaching the following statements. While this cannot occur in our flow insensitive analysis, it is possible in a flow sensitive analysis. In our framework, although function pointers are ....

M.G. Burke and B.G. Ryder. A critical analysis of incremental iterative data flow analysis algorithms. IEEE Transactions on Software Engineering, 16(7):723--728, July 1990.

No context found.

M. G. Burke and B. G. Ryder. A Critical Analysis of Incremental Iterative Data Flow Analysis Algorithms. IEEE Transactions on Software Engineering, 16(7):723--728, 1990.

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