Notes on Graph Algorithms Used in Optimizing Compilers (1995)
| Citations: | 2 - 0 self |
BibTeX
@MISC{Offner95noteson,
author = {Carl D. Offner and Depth-first Walks},
title = {Notes on Graph Algorithms Used in Optimizing Compilers},
year = {1995}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Frameworks for Data-Flow Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . 66 5.5 Solutions of Abstract Data Flow Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 5.6 Two More Data-Flow Analysis Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75 5.7 How Many Iterations are Needed? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77 5.8 Algorithms Based on Reducibility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82 5.8.1 Allen and Cocke's Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83 5.8.2 Schwartz and Sharir's Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 5.8.3 Dealing With Non-Reducible Flow Graphs . . . . . . . . . . . . . . . . . . . . . . . . . 89 Chapter 1 Depth-First Walks We will be working with directed graphs in this set of notes. Such graphs are used in compilers for modeling internal representations of programs being comp...
