Suresh Jagannathan
where else to find them
linkedin:sureshjagannathan
what they talk about
all 5 in the filters
where they keep going back
- OOPSLA4 editions2021–2025
- PLDI Workshop Honoring Andreas Podelski3 editions2023–2026
all 6 in the filters
on a stage with
all 12 in the filters
who talks about the same things
- Zhe Zhou13 talks
- Benjamin Delaware18 talks
- Ashish Mishra3 talks
- Kartik Nagar6 talks
- Benjamin C. Pierce17 talks
- Jonathan Aldrich17 talks
| title | conference | date |
|---|---|---|
| Synthesizing Runners Using Copatterns | HOPE 2026 | 2026-08-24 |
Deductive synthesis produces an adapter (runner) from coinductive copatterns specifications that filters environment behaviors into client-expected traces; the… | ||
| Trace-Guided Synthesis of Effectful Test Generators | PLDI 2026 | 2026-06-15 |
Underapproximate type-and-effect specs (U-hats) plus a small typed DSL synthesize effectful test generators that interact with black-box systems rather than… | ||
| We’ve Got You Covered: Type-Guided Repair of Incomplete Input Generators | OOPSLA 2025 | 2025-10-16 |
A tool called Cobb repairs incomplete OCaml input generators by synthesizing code that fills typed holes so the generator’s range includes every valid input… | ||
| From Traces to Program Incorrectness: A Type-Theoretic Approach | TPSA 2025 | 2025-01-19 |
Claims a type-theoretic, underapproximate correctness method that treats library interactions as traces encoded with symbolic regular expressions and reasoned… | ||
| Derivative-Guided Symbolic Execution | POPL 2025 | 2025-01-19 |
Framework builds a symbolic execution for functional code that calls opaque, effectful libraries, encoding LTLf specs as symbolic finite automata and using… | ||
| Automated Robustness Verification of Concurrent Data Structure Libraries Against(…) | OOPSLA 2024 | 2024-10-20 |
An automated procedure verifies that C11-style concurrent data-structure implementations are robust by checking that every relaxed-memory execution is possible… | ||
| A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite(…) | PLDI 2024 | 2024-06-24 |
Describes a toolchain that uses symbolic finite automata to encode data-dependent, temporal representation invariants and integrates them into a refinement… | ||
| Type-Based Incorrectness Reasoning | Incorrectness 2024 | 2024-01-17 |
Claims that coverage types extend refinement types to give underapproximate reasoning that verifies completeness of nondeterministic test generators, and shows… | ||
| Covering All the Bases: Type-Based Verification of Test Input Generators | PLDI 2023 | 2023-06-17 |
Claims a new coverage types system that interprets refinements as underapproximate reasoning and verifies whether generators actually produce every value in a… | ||
| Specification-Guided Component-Based Synthesis from Effectful Libraries | OOPSLA 2022 | 2022-12-05 |
Cobalt implements Hoare-style pre/post specifications over OCaml libraries and combines spec-guided bi-directional search (backward weakest-pre to forward… | ||
| Data-Driven Abductive Inference of Library Specifications | OOPSLA 2021 | 2021-10-17 |
Tool named Elrond infers specifications for black‑box OCaml libraries by combining random testing, SMT counterexample-guided refinement, and an abduction loop… | ||
| nothing matches | ||