15 citations · 66 across the 23 of their papers we have counts for
4 papers · 1 filter
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…
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…
Efficient Algorithms for Partial Constraint Satisfaction Problems over Control-flow Graphs
Xuran Cai, Amir Goharshady
In this work, we focus on the Partial Constraint Satisfaction Problem (PCSP) over control-flow graphs (CFGs) of programs. PCSP serves as a generalization of the well-known Constrai…
Quantifier Elimination Meets Treewidth
Hao Wu, Jiyu Zhu, Amir Kafshdar Goharshady +3
In this paper, we address the complexity barrier inherent in Fourier-Motzkin elimination (FME) and cylindrical algebraic decomposition (CAD) when eliminating a block of (existentia…