Janggun Lee
where else to find them
what they talk about
where they keep going back
- OOPSLA3 editions2023–2025
- PLDI Workshop Honoring Andreas Podelski2 editions2024–2025
on a stage with
all 17 in the filters
who talks about the same things
- Sunho Park4 talks
- Jeehoon Kang14 talks
- Jaehwang Jung5 talks
- Jaewoo Kim3 talks
- Dongjae Lee5 talks
- Chung-Kil Hur10 talks
| title | conference | date |
|---|---|---|
| Lilo: A Higher-Order, Relational Concurrent Separation Logic for Liveness | OOPSLA 2025 | 2025-10-16 |
Lilo is a higher-order concurrent separation logic that adds a promise mechanism to reason about liveness: threads record a promise list and must consume… | ||
| Leveraging Immutability to Validate Hazard Pointers for Optimistic Traversals | PLDI 2025 | 2025-06-16 |
Presents a new hazard-pointer validation that exploits the immutability of marked nodes to validate reachability by checking the most recent unmarked… | ||
| Verifying General-Purpose RCU for Reclamation in Relaxed Memory Separation Logic | PLDI 2025 | 2025-06-16 |
First formal verification of a general-purpose RCU under relaxed memory consistency, proving a modular spec that supports modular specification, switchable… | ||
| Verifying Lock-Free Traversals in Relaxed Memory Separation Logic | PLDI 2025 | 2025-06-16 |
First mechanized verification of a lock-free linked list, skiplist, and skiplist-based priority queue against relaxed memory consistency, using the iRC11… | ||
| Quantum Probabilistic Model Checking for Time-Bounded Properties | OOPSLA 2024 | 2024-10-20 |
Encodes time-bounded probabilistic model checking as quantum circuits that superpose the 2^n state distribution, implements state transition circuits by… | ||
| A Proof Recipe for Linearizability in Relaxed Memory Separation Logic | PLDI 2024 | 2024-06-24 |
This work gives a concrete proof recipe and mechanization in Coq (Iris-based iRC11) that reduces manual effort by about 81% via automation, introduces object… | ||
| Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic | OOPSLA 2023 | 2023-10-23 |
Proposes modular, machine-checked specs for hazard pointers and RCU and proves realistic reclamation implementations in Coq, mechanized in Iris. Claims… | ||
| nothing matches | ||