Zhe Zhou
where else to find them
no profile links on file
what they talk about
all 9 in the filters
where they keep going back
- PLDI Workshop Honoring Andreas Podelski3 editions2023–2026
- OOPSLA2 editions2021–2025
all 10 in the filters
on a stage with
all 27 in the filters
who talks about the same things
- Suresh Jagannathan16 talks
- Benjamin Delaware18 talks
- Ashish Mishra3 talks
- Benjamin C. Pierce17 talks
- Yizhou Zhang13 talks
- Zhendong Su25 talks
| title | conference | date |
|---|---|---|
| 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… | ||
| 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… | ||
| Userspace Bypass: Accelerating Syscall-intensive Applications | OSDI 2023 | 2023-07-10 |
Userspace Bypass (UB) transparently moves short user-space instruction sequences into kernel space by identifying hot fast paths, translating them into a… | ||
| 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… | ||
| PetS: A Unified Framework for Parameter-Efficient Transformers Serving | USENIX ATC '22 | 2022-07-11 |
PetS is a serving framework that decouples PET methods into shared operators and lightweight task-specific PET operators, implements a Python front end with a… | ||
| 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… | ||
| SaFace: Towards Scenario-aware Face Recognition via Edge Computing System | 3rd USENIX Workshop on Hot Topics in Edge Computing (HotEdge '20) | 2020-06-25 |
Prototype implements a three-layer edge system that pretrains a CNN in the cloud, runs detection/alignment/tracking on smart cameras, and does inference plus… | ||
| All Your Payment Tokens Are Mine: Vulnerabilities of Mobile Payment Systems | Black Hat Asia 2018 | 2018-03-20 |
Shows that offline mobile payment tokens sent over QR, audio or MST are trivially sniffed and replayed: researchers extend MST range to 2-meter MST sniff… | ||
| Picking Up My Tab... | 26th USENIX Security Symposium (USENIX Security '17) | 2017-08-16 |
Researchers demonstrate a practical attack called Synchronized Token Lifting and Spending (STLS) that sniffs an offline payment token on NFC/MST, audio or… | ||
| nothing matches | ||