Splitting the Control Flow with Boolean Flags
No abstract available.
Related papers
- Making Graphs Reducible with Controlled Node Splitting TOPLAS 1997
- Polymorphic Splitting: An Effective Polyvariant Flow Analysis TOPLAS 1998
- Folklore confirmed: reducible flow graphs are exponentially larger POPL 2003
- Input space splitting for OpenCL CC 2016
- Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis POPL 1997
- Relating complexity and precision in control flow analysis ICFP 2007
- Handling irreducible loops: optimized node splitting versus DJ-graphs TOPLAS 2002
- Profile-based global live-range splitting PLDI 2006