Adithya Murali
where else to find them
no profile links on file
what they talk about
where they keep going back
- OOPSLA3 editions2022–2025
- PLDI Workshop Honoring Andreas Podelski2 editions2024–2026
on a stage with
all 15 in the filters
who talks about the same things
- P. Madhusudan10 talks
- Sharon Shoham13 talks
- Oded Padon11 talks
- Lucas Peña3 talks
- Michael Sammler16 talks
- Mooly Sagiv18 talks
| title | conference | date |
|---|---|---|
| Verification Modulo Tested Library Contracts | PLDI 2026 | 2026-06-15 |
Proposes a concrete pipeline that synthesizes method contracts and loop invariants by looping a generalizing CHC solver (ICE learners, decision trees, optional… | ||
| Separating the Wheat from the Chaff: Understanding (In-)Completeness of Proof(…) | POPL 2026 | 2026-01-11 |
Main claim: the common fold/unfold proof steps are sound and — for the quantifier‑free, theory‑free fragment — complete for a weaker semantics called Weak… | ||
| FO-Complete Program Verification for Heap Logics | OOPSLA 2025 | 2025-10-16 |
Claims a practical verification pipeline that achieves FO-Complete reasoning for heap logics by designing two logics — frame logic (FL) and SL-FL — with… | ||
| Predictable Verification using Intrinsic Definitions | PLDI 2024 | 2024-06-24 |
Proposes that defining heap structures with intrinsic definitions — auxiliary monadic maps plus local constraints — makes verification decidable and therefore… | ||
| Complete First-Order Reasoning for Properties of Functional Programs | OOPSLA 2023 | 2023-10-23 |
The paper proves that the unfolding-then-SMT procedure (USMT heuristic) used by Liquid Haskell, Leon and Stainless is sound and complete for the combined… | ||
| Synthesizing Axiomatizations using Logic Learning | OOPSLA 2022 | 2022-12-05 |
A synthesis pipeline called the LAS framework combines a soundness checker, counterexample generator, independence checker and constraint-based logic learner… | ||
| nothing matches | ||