Zachary Kincaid
where else to find them
no profile links on file
what they talk about
all 6 in the filters
where they keep going back
on a stage with
all 9 in the filters
who talks about the same things
- Shaowei Zhu2 talks
- Thomas Reps20 talks
- Sharon Shoham13 talks
- Yizhou Zhang13 talks
- Steve Zdancewic19 talks
- Takeshi Tsukada16 talks
| title | conference | date |
|---|---|---|
| A Categorical Basis for Robust Program Analysis | PLDI 2026 | 2026-06-15 |
A categorical framework characterizes robustness: programs and properties become concrete categories over a base of transformations, and robust analyses become… | ||
| Context-Free-Language Reachability for Almost-Commuting Transition Systems | POPL 2026 | 2026-01-11 |
Proves that the Parikh-image machinery extends to an almost-commuting monoid, giving a polynomial-time procedure that produces a Presburger formula describing… | ||
| Network Change Validation with Relational NetKAT | POPL 2026 | 2026-01-11 |
Relational NetKAT is a specification language for change-by-trace: programs describe a trace relation R and compile it to NetKAT transducers and automata so… | ||
| Software Model Checking via Summary-Guided Search | OOPSLA 2025 | 2025-10-16 |
GPS presents a concrete algorithm that interleaves directed testing with summary-guided search: it queries an SMT solver for models, uses a summary oracle… | ||
| Monotone Procedure Summarization via Vector Addition Systems and Inductive Potentials | OOPSLA 2024 | 2024-10-20 |
Computes the best VASR reflection that linearly simulates the program, then exactly solves context-free-language reachability over that VASR to get procedure… | ||
| Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis | POPL 2024 | 2024-01-14 |
Generates loop summaries that abstractions arbitrary loop bodies into a solvable polynomial ideal and then applies a proven complete solver (a generalization… | ||
| When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic | POPL 2023 | 2023-01-15 |
Presents a decidable first‑order theory called LIRR (linear integer/real with weak multiplication), a concrete axiomatization and an effective model… | ||
| nothing matches | ||