Now showing items 1-4 of 4

    • Dependence Flow Graphs: An Algebraic Approach to Program Dependencies 

      Pingali, Keshav; Beck, Micah; Johnson, Richard C.; Moudgill, Mayan; Stodghill, Paul (Cornell University, 1990-09)
      The topic of intermediate languages for optimizing and parallelizing compilers has received much attention lately. In this paper, we argue that any good representation must have two crucial properties: first, the ...
    • Efficient Program Analysis Using Dependence Flow Graphs 

      Johnson, Richard C. (Cornell University, 1994-11)
      Program analysis plays a major role in advanced compilers, yet traditional approaches to data flow analysis are quite time consuming. Prior techniques for speeding up data flow analysis have either exploited program structure ...
    • Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time 

      Johnson, Richard C.; Pearson, David; Pingali, Keshav (Cornell University, 1993-07)
      Many compilation problems require computing the control dependence equivalence relation which divides nodes in a control flow graph into equivalence classes such that nodes are in the same class if and only if they have ...
    • Parallel Algorithms For Maximum Matching And Other Problems On Interval Graphs 

      Moitra, Abha; Johnson, Richard C. (Cornell University, 1988-07)
      In this paper, we consider parallel algorithms on interval graphs. An interval graph is a graph having a one-to-one correspondence with a sequence of intervals on the real line, such that each vertex maps to an interval ...