Bor-Yuh Evan Chang
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
all 6 in the filters
on a stage with
all 19 in the filters
who talks about the same things
- Gowtham Kaki10 talks
- Benno Stein3 talks
- Aseem Rastogi7 talks
- Anders Møller6 talks
- Andreas Pavlogiannis18 talks
- Suresh Jagannathan16 talks
| title | conference | date |
|---|---|---|
| Ravencheck: Effectively-Propositional Reasoning for Rust | SOAP 2026 | 2026-06-16 |
Ravencheck encodes a purely functional subset of Rust into EEPR with relational abstraction and calls SMT solvers (cvc5 or Z3) to get decidable, fast… | ||
| Towards Cumulative Abstract Semantics via Handlers (Short Paper) | PEPM 2026 | 2026-01-11 |
Proposes using algebraic effects to separate value creation and control flow: implement domain-specific introduction handlers (concrete ints, intervals with… | ||
| Bolt-On Strong Consistency: Specification, Implementation, and Verification | OOPSLA 2025 | 2025-10-16 |
Shows how consensus safety can be proved from local properties by implementing strong replication atop a causal weak store and verifying at the single-node… | ||
| Cyclic Message Histories for Automated Safety Verification of Distributed Algorithms | TPSA 2025 | 2025-01-19 |
Claims an automated verifier that uses a separation logic augmented with message histories and a goal-directed abstract interpretation to soundly… | ||
| Interactive Abstract Interpretation with Demanded Summarization | PLDI 2024 | 2024-06-24 |
Presents demanded summarization, an algorithm and engine that makes summary‑based abstract interpretation incremental and compositional while supporting… | ||
| Historia: Refuting Callback Reachability with Message-History Logics | OOPSLA 2023 | 2023-10-23 |
Defines message histories (sequences of boundary call-ins/callbacks) and a temporal message-history logic, implements a prototype verifier called Historia that… | ||
| Goal-Directed Abstract Interpretation and Event-Driven Frameworks | SAS 2023 | 2023-10-22 |
Argues for goal-directed backward analysis that models only callbacks relevant to a single error, implements abstract message histories to represent realizable… | ||
| Lifting On-Demand Analysis to Higher-Order Languages | SAS 2023 | 2023-10-22 |
Claims an on-demand algorithm that bootstraps call graph construction by interleaving two on-demand data‑flow queries, formalizes the method as an… | ||
| Selectively-Amortized Resource Bounding | SAS 2021 | 2021-10-17 |
Presents a framework that proves resource bounds by mixing worst-case and amortized reasoning, proves any partitioning into amortization segments sound, and… | ||
| nothing matches | ||