Controlled Node Splitting
No abstract available.
Related papers
- Making Graphs Reducible with Controlled Node Splitting TOPLAS 1997
- Handling irreducible loops: optimized node splitting versus DJ-graphs TOPLAS 2002
- Folklore confirmed: reducible flow graphs are exponentially larger POPL 2003
- Online feedback-directed optimization of Java OOPSLA 2002
- Splitting the Control Flow with Boolean Flags SAS 2008
- Optimistic register coalescing TOPLAS 2004
- Using Node Merging to Enhance Graph Coloring PLDI 1999
- Reorganizing Split Objects OOPSLA 1996