BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-76-547
       ENTRY:: July 04, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Iterative algorithms for global flow analysis
        TYPE:: Technical Report
      AUTHOR:: Tarjan, Robert Endre
        DATE:: March 1976
       PAGES:: 38
    ABSTRACT:: This paper studies iterative methods for the global flow
               analsis of computer programs. We define a hierarchy of global
               flow problem classes, each solvable by an appropriate
               generalization of the "node listing" method of Kennedy. We
               show that each of these generalized methods is optimum, among
               all iterative algorithms, for solving problems within its
               class. We give lower bounds on the time required by iterative
               algorithms for each of the problem classes.
       NOTES:: [Adminitrivia V1/Prg/19950704]
         END:: STAN//CS-TR-76-547