R. T. Prosser. Applications of Boolean matrices to the analysis of flow diagrams. In Proceedings of the 16th Eastern Joint Computer Conference, pages 133--138, 1959.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....7 6 5 2 3 4 1 Data Dependence Control Dependence Figure 2.2: Dependence Graph for Example Code in Figure 2.1. 2. 2 History of Dependence Analysis Research Our search of the literature nds that the rst discussion of automated program dependence analysis should be attributed to Prosser [43], who in 1959 made the observation that graphical representations of the control ow among program statements and the related dominance relationships among vertices of the graph could be used to automate identi cation of dependencies among program statements. In the late 1960s researchers ....

....The remainder of this section contains a concise history of dependence analysis, including descriptions and discussion of major contributions along the way. 2.2. 1 1959 In December 1959, Prosser, a scientist at MIT s Lincoln Laboratory, introduced the notion of automated reachability analysis [43] by way of applying matrix addition and multiplication to three types of matrices: one that records the potential for control to ow from one statement directly to another, another that records the def=use relationships among statements, and another that records the dominance relationships. It ....

R.T. Prosser. Applications of Boolean Matrices to the Analysis of Flow Diagrams. In 1959.

....dead if they are in B 1 [15] 3. 2 Dominator path scheduling dps was originally described in Sweany s thesis [20] Other work was done by Sweany and Beaty [21] and Huber [12] We say a basic block B 1 dominates block B 2 if all paths from the start block of the cfg to B 2 must pass through B 1 [18]. If B 1 dominates B 2 , and block B 2 executes on a given program run, then B 1 must also execute. We define the immediate dominator of a block B (or idom(B) to be the dominator closest to B in the cfg. Each block must have a unique immediate dominator, except the start block which has no ....

R.T. Prosser. Applications of boolean matrices to the analysis of flow diagrams. In Proceedings of the Eastern Joint Computer Conference, pages 133-- 138. Spartan Books, NY, USA, December 1959.

....should be the technique of choice for computing dominators on cfgs. The dominance problem is an excellent example of the need to balance theory with practice. Ever since Lowry and Medlock s O(N )algorithm appeared in 1969 [23] researchers have steadily improved the time bound for this problem [7, 10, 17, 19, 22, 26, 29]. However, our results suggest that these improvements in asymptotic complexity may nothelponrealisticallyCopyright c sized examples, and that careful engineering makes the iterative scheme the clear method of choice. History Prosser introduced the notion of dominance in a 1959 paper on the ....

....a 1959 paper on the analysis of flow diagrams, defining it as follows: We say box i dominates box j if every path (leading from input to output through the diagram) which passes through box j must also pass through box i. Thusbox i dominates box j if box j is subordinate to box i in the program [26]. He used dominance to prove the safety of code reordering operations, but he did not explain the algorithm to computedominance from his connectivity matrix. Ten years l ater, Lowry and Medlock sketched an algorithm to compute dominators [23] In essence, their algorithm considers all of the ....

R. Prosser. Applications of boolean matrices to the analysis of flow diagrams. In Proceedings of the Eastern Joint Computer Conference,pages 133--138. Spartan Books, NY, USA, Dec. 1959.

....dead if they are in B 1 [16] 3. 2 Dominator path scheduling dps was originally described in Sweany s thesis [21] Other work was done by Sweany and Beaty [22] and Huber [13] We say a basic block B 1 dominates block B 2 if all paths from the start block of the cfg to B 2 must pass through B 1 [19]. If B 1 dominates B 2 ,and block B 2 executes on a given program run, then B 1 must also execute. We define the immediate dominator of a block B (or idom(B) to be the dominator closest to B in the cfg. Each block must have a unique immediate dominator, except the start block which has no ....

R.T. Prosser. Applications of boolean matrices to the analysis of flow diagrams. In Proceedings of the Eastern Joint Computer Conference, pages 133--138. Spartan Books, NY, USA, December 1959.

No context found.

R. T. Prosser. Applications of Boolean matrices to the analysis of flow diagrams. In Proceedings of the 16th Eastern Joint Computer Conference, pages 133--138, 1959.

No context found.

R.T. Prosser. Applications of Boolean Matrices to the Analysis of Flow Diagrams. In 1959.

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