A Fast Cutting-Plane Algorithm for Optimal Coalescing
Abstract elided by the publisher.
Related papers
- Fast Copy Coalescing and Live-Range Identification PLDI 2002
- Fast linear programming through transprecision computing on small and sparse data OOPSLA 2020
- Mechanizing conventional SSA for a verified destruction with coalescing CC 2016
- Effective communication coalescing for data-parallel applications PPoPP 2005
- Fast interprocedural linear two-variable equalities TOPLAS 2011
- Context Sensitivity without Contexts: A Cut-Shortcut Approach to Fast and Precise Pointer Analysis PLDI 2023
- KATch: A Fast Symbolic Verifier for NetKAT PLDI 2024
- Optimizing Translation Out of SSA Using Renaming Constraints CGO 2004