G. Bilardi and K. Pingali. A framwork for generalized control dependence. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 291-300, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....W. Lauridsen Mikkel Thorup Abstract A linear time algorithm is presented for nding dominators in control ow graphs. 1 Introduction Finding the dominator tree for a control ow graph is one of the most fundamental problems in the area of global ow analysis and program optimization [2, 3, 4, 5, 10, 15]. The problem was rst raised in 1969 by Lowry and Medlock [15] where an O(n 4 ) algorithm for the problem was proposed (as usual, n is the number of nodes and m the number of edges in a graph) The result has been improved several times (see e.g. 1, 2, 17, 20] and in 1979 an O(m (m;n) ....

....been improved several times (see e.g. 1, 2, 17, 20] and in 1979 an O(m (m;n) algorithm was found by Lengauer and Tarjan [14] Finally, at STOC 85, Dov Harel [11] announced a linear time algorithm. Assuming Harel s result, linear time algorithms have been found for many other problems (see e.g. [4, 5, 10]) However, Harel never produced the details of his algorithm and the soundness of his approach has therefore been questioned. Here we rst describe some of the concrete problems in Harel s approach, of which the most important is that the algorithm presented is not linear. Secondly, using ....

G. Bilardi and K. Pingali. A framwork for generalized control dependence. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 291-300, 1996.

....in control ow graphs. Key words. Control ow analysis, dominators, algorithms AMS subject classi cations. 68Q25, 68N20 1. Introduction. Finding the dominator tree for a control ow graph is one of the most fundamental problems in the area of global ow analysis and program optimization [2, 3, 4, 6, 12, 17]. The problem was rst raised in 1969 by Lowry and Medlock [17] where an O(n 4 ) algorithm for the problem was proposed (as usual, n is the number of nodes and m the number of edges in a graph) The result has been improved several times (see e.g. 1, 2, 19, 22] and in 1979 an O(m (m;n) ....

....19, 22] and in 1979 an O(m (m;n) algorithm was found by Lengauer and Tarjan [16] Here is the inverse Ackermann s function. Finally, at STOC 85, Dov Harel [13] announced a linear time algorithm. Based on Harel s result, linear time algorithms have been found for many other problems (see e.g. [4, 6, 12]) Harel s description was, however, incomplete. In this paper, we give a complete description of a di erent and simpler linear time dominator algorithm. The paper is divided as follows. In section 2 the main de nitions are given. In section 3 we outline the Lengauer Tarjan algorithm and in ....

G. Bilardi and K. Pingali, A framwork for generalized control dependence, in ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 1996, pp. 291-300.

....in control flow graphs. Key words. Control flow analysis, dominators, algorithms. AMS subject classifications. 68Q25, 68N20. 1 Introduction Finding the dominator tree for a control flow graph is one of the most fundamental problems in the area of global flow analysis and program optimization [2, 3, 4, 5, 10, 15]. The problem was first raised in 1969 by Lowry and Medlock [15] where an O(n 4 ) algorithm for the problem was proposed (as usual, n is the number of nodes and m the number of edges in a graph) The result has been improved several times (see e.g. 1, 2, 17, 20] and in 1979 an O(mff(m; n) ....

....improved several times (see e.g. 1, 2, 17, 20] and in 1979 an O(mff(m; n) algorithm was found by Lengauer and Tarjan [14] Finally, at STOC 85, Dov Harel [11] announced a linear time algorithm. Based on Harel s result, linear time algorithms have been found for many other problems (see e.g. [4, 5, 10]) Harel s description was, however, incomplete. In this paper, we give a complete description of a different and simpler linear time dominator algorithm. The paper is divided as follows. In section 2 the main definitions are given. In section 3 we outline the Lengauer Tarjan algorithm and in ....

G. Bilardi and K. Pingali. A framwork for generalized control dependence. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 291--300, 1996.

....W. Lauridsen Mikkel Thorup Abstract A linear time algorithm is presented for finding dominators in control flow graphs. 1 Introduction Finding the dominator tree for a control flow graph is one of the most fundamental problems in the area of global flow analysis and program optimization [2, 3, 4, 5, 10, 15]. The problem was first raised in 1969 by Lowry and Medlock [15] where an O(n 4 ) algorithm for the problem was proposed (as usual, n is the number of nodes and m the number of edges in a graph) The result has been improved several times (see e.g. 1, 2, 17, 20] and in 1979 an O(mff(m; n) ....

....improved several times (see e.g. 1, 2, 17, 20] and in 1979 an O(mff(m; n) algorithm was found by Lengauer and Tarjan [14] Finally, at STOC 85, Dov Harel [11] announced a linear time algorithm. Assuming Harel s result, linear time algorithms have been found for many other problems (see e.g. [4, 5, 10]) However, Harel never produced the details of his algorithm and the soundness of his approach has therefore been questioned. Here we first describe some of the concrete problems in Harel s approach, of which the most important is that the algorithm presented is not linear. Secondly, using ....

G. Bilardi and K. Pingali. A framwork for generalized control dependence. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 291--300, 1996.

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