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.PL2023
Parameterized Algorithms for Scalable Interprocedural Data-flow Analysis
Ahmed Khaled Zaher
Data-flow analysis is a general technique used to compute information of interest at different points of a program and is considered to be a cornerstone of static analysis. In this…