Showing cs.PLShow all
2 papers · 1 filter
cs.PL2026
Parameterized Algorithms and Complexity for Function Merging with Branch Reordering
Amir K. Goharshady, Kerim Kochekov, Tian Shu +1
Binary size reduction is an increasingly important optimization objective for compilers. One emerging technique is function merging, where multiple similar functions are merged int…
cs.PL2026
Series-Parallel-Loop Decompositions of Control-flow Graphs
Xuran Cai, Amir Goharshady, S Hitarth +1
Control-flow graphs (CFGs) of structured programs are well known to exhibit strong sparsity properties. Traditionally, this sparsity has been modeled using graph parameters such as…