Alexandra Silva
where else to find them
no profile links on file
what they talk about
all 6 in the filters
where they keep going back
- PLDI Workshop Honoring Andreas Podelski3 editions2024–2026
- POPL3 editions2022–2026
- OOPSLA2 editions2023–2024
all 8 in the filters
on a stage with
all 27 in the filters
who talks about the same things
- Noam Zilberstein6 talks
- Joseph Tassarotti20 talks
- Dexter Kozen4 talks
- Sharon Shoham13 talks
- Lars Birkedal35 talks
- Jules Jacobs11 talks
| title | conference | date |
|---|---|---|
| From Rewriting to Fixpoints: Solving Recursive Equations with E-Graphs | EGRAPHS 2026 | 2026-06-15 |
Extends e-graphs to represent recursive variables by adding secondary definitional edges that link a variable to its definition without merging, builds a… | ||
| Weighted NetKAT: A Programming Language For Quantitative Network Verification | PLDI 2026 | 2026-06-15 |
Weighted NetKAT extends NetKAT to be parametric on a semiring and provides both denotational and operational semantics plus a compiler that turns programs into… | ||
| Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and(…) | POPL 2026 | 2026-01-11 |
Introduces Probabilistic Concurrent Outcome Logic (pcOL) that composes concurrent separation logic, probabilistic separation logic, and Outcome Logic to prove… | ||
| StacKAT: Infinite State Network Verification | PLDI 2025 | 2025-06-16 |
Defines StacKAT, a packet-language that adds a single variable-size stack payload with push/pop to NetKAT-style programs and proves program equivalence… | ||
| Active Learning of Symbolic NetKAT Automata | PLDI 2025 | 2025-06-16 |
Presents algorithms that learn symbolic NetKAT automata from active queries, proves soundness and termination, and ships a prototype implementation with… | ||
| Keynote Talk: Outcome Logic: a foundational framework for concurrent and probabilistic(…) | VMCAI 2025 | 2025-01-20 |
Presents Outcome Logic as a concrete framework that gives a compositional denotational semantics for programs mixing nondeterminism/concurrency and randomness… | ||
| Total Outcome Logic: Termination and Nontermination Proving for Effectful Branching | TPSA 2025 | 2025-01-19 |
Presents Total Outcome Logic, a single logic that models program runs as maps from states to semiring-weighted outcomes and adds an explicit divergence outcome… | ||
| A Demonic Outcome Logic for Randomized Nondeterminism | POPL 2025 | 2025-01-19 |
Introduces Demonic Outcome Logic that models randomized programs with adversarial nondeterminism using the convex power set semantics, proving a distributive… | ||
| Outcome Separation Logic: Local Reasoning for Correctness and Incorrectness with(…) | OOPSLA 2024 | 2024-10-20 |
Outcome Separation Logic gives a single formalism that proves both correctness and incorrectness for programs with effects by making postconditions talk about… | ||
| KATch: A Fast Symbolic Verifier for NetKAT | PLDI 2024 | 2024-06-24 |
KATch implements NetKAT verification in Scala and replaces exhaustive packet enumeration with symbolic packets, BDD-style relations called SPs that are… | ||
| Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasonin... | OOPSLA 2023 | 2023-10-23 |
Outcome Logic (OL) replaces a single postcondition with outcome-indexed assertions over sets of states, adds an outcome conjunction that composes reachable… | ||
| On Iteration in Discrete Probabilistic Programming | LAFI 2023 | 2023-01-15 |
Extends the discrete PPL dice with two concrete unbounded-iteration constructs and shows how exact inference still runs by compiling into binary decision… | ||
| Finding a research topic (or being found by a research topic?) | PLMW @ POPL 2022 | 2022-01-17 |
Chronicles a research path that starts with an undergraduate project on the compfish framework and evolves through four years of co-algebra, a postdoc building… | ||
| Coalgebra for the working programming languages researcher | POPL 2022 | 2022-01-16 |
Coalgebraic methods center on a functor that generates syntax, denotational and operational semantics, and equivalence proofs; from that one structure… | ||
| nothing matches | ||