Amir Kafshdar Goharshady
where else to find them
no profile links on file
what they talk about
all 5 in the filters
where they keep going back
- OOPSLA2 editions2023–2024
on a stage with
all 15 in the filters
who talks about the same things
- Hongfei Fu6 talks
- Ahmed Khaled Zaher3 talks
- Kerim Kochekov2 talks
- S. Hitarth2 talks
- Krishnendu Chatterjee11 talks
- Giovanna Kobus Conrado4 talks
| title | conference | date |
|---|---|---|
| Parameterized Algorithms and Complexity for Function Merging with Branch Reordering | PLDI 2026 | 2026-06-15 |
Shows that allowing function merging with branch reordering makes the optimization NP-hard, then gives parameterized algorithms: a constructive FPT algorithm… | ||
| Fast and Optimal Extraction for Sparse Equality Graphs | OOPSLA 2024 | 2024-10-20 |
The paper proves e-graph extraction is NP-hard and hard to approximate by reduction from set cover, then gives a fixed-parameter tractable dynamic program over… | ||
| Quantitative Bounds on Resource Usage of Probabilistic Programs | OOPSLA 2024 | 2024-10-20 |
Extends cost supermartingales to yield sound expectation bounds for programs with positive and negative costs and unbounded updates provided a lower bounded… | ||
| Asparagus: Automated Synthesis of Parametric Gas Upper-Bounds for Smart Contrac... | OOPSLA 2023 | 2023-10-23 |
Asparagus is a tool that takes Solidity/EVM bytecode, over-approximates it into polynomial transition systems, and synthesizes linear or polynomial parametric… | ||
| Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Program... | OOPSLA 2023 | 2023-10-23 |
Algorithm reduces template-based synthesis of polynomial imperative programs to Quadratic Programming by applying Farkas, Handelman, Putinar (SOS) and the Real… | ||
| The Bounded Pathwidth of Control-Flow Graphs | OOPSLA 2023 | 2023-10-23 |
Proves control-flow graphs of structured, goto-free programs have pathwidth at most 2·nesting depth, and gives a linear-time path decomposition construction… | ||
| Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-... | OOPSLA 2023 | 2023-10-23 |
Claims an on-demand APA pipeline that, after n·log n·k preprocessing, answers any pairwise path-summary query in O(k) per query by precomputing only O(n log n)… | ||
| Efficient Interprocedural Data-Flow Analysis using Treedepth and Treewidth | VMCAI 2023 | 2023-01-15 |
Claims a concrete IFDS solver that exploits treedepth of the call graph and treewidth of control-flow graphs, constructs an exploded code graph, and achieves… | ||
| nothing matches | ||