Giovanna Kobus Conrado
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
all 8 in the filters
who talks about the same things
- Ahmed Khaled Zaher3 talks
- Kerim Kochekov2 talks
- Amir Kafshdar Goharshady10 talks
- Chun Kit Lam3 talks
- Yulei Sui8 talks
- Thomas Reps20 talks
| title | conference | date |
|---|---|---|
| Program Analysis via Multiple Context Free Language Reachability | POPL 2025 | 2025-01-19 |
Introduces MCFL reachability as a tunable, decidable underapproximation for interleaved Dyck (context-sensitive) reachability, implements an algorithm with… | ||
| A Better Approximation for Interleaved Dyck Reachability | SOAP 2024 | 2024-06-25 |
Proposes a concrete overapproximation that extends mutual refinement by adding refined CFLs (grammars that encode parity and endpoint constraints) and an… | ||
| 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)… | ||
| nothing matches | ||