Sanjit A. Seshia
where else to find them
what they talk about
where they keep going back
- OOPSLA2 editions2023–2025
all 5 in the filters
on a stage with
all 7 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Checking Observational Correctness of Database Systems | OOPSLA 2025 | 2025-10-16 |
Tool encodes transaction behavior with a version-aware semantics and checks isolation via explicit SMT constraints so the checker asks whether any valid… | ||
| Message Chains for Distributed System Verification | OOPSLA 2023 | 2023-10-23 |
Defines message chains as a listlike datatype that records send history so proofs avoid reasoning about individual messages or buffers, and implements an… | ||
| Satisfiability and Synthesis Modulo Oracles | VMCAI 2022 | 2022-01-16 |
Defines a formal SMTO/SyMO framework that plugs executable black‑box oracles into SMT/synthesis via assumption generator and constraint generator interfaces… | ||
| Towards Verified Deep Learning | Emerging Challenges in Deep Learning (Simons Institute workshop, 2019) | 2019-08-05 |
Argues that formal methods plus environment models let verification scale: replaces neural nets by an over-approximation (always wrong) and an… | ||
| Real-Time Monitoring, Verification, and Control of Cyber-Physical Systems | Societal Networks 2018 | 2018-03-26 |
Introduces satisfiability modulo convex programming — a concrete solver that loops a SAT engine with a convex optimizer that returns infeasibility… | ||
| Characterizing the Typical Case Complexity of Formal Verification and Synthesis | Learning, Algorithm Design and Beyond Worst-Case Analysis | 2016-11-14 |
Three research threads: graph-based SAT structure, SMT encodings, and invariant synthesis. Shows that common modularity metrics can be embedded to make SAT… | ||
| nothing matches | ||