Minseok Jeon
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
- OOPSLA3 editions2018–2025
on a stage with
- Hakjoo Oh4×
- Doha Hwangonce
- Donguk Kimonce
all 5 in the filters
who talks about the same things
- Hakjoo Oh11 talks
- Myungho Lee4 talks
- Jihyeok Park3 talks
- Tian Tan9 talks
- Dongjae Lee5 talks
- Minxue Pan2 talks
| title | conference | date |
|---|---|---|
| PAFL: Enhancing Fault Localizers by Leveraging Project-Specific Fault Patterns | OOPSLA 2025 | 2025-10-16 |
PAFL mines project histories to synthesize project-specific fault patterns and boosts existing fault localizers by reweighting statement suspiciousness. It… | ||
| PL4XGL: A Programming Language Approach to Explainable Graph Learning | PLDI 2024 | 2024-06-24 |
Proposes PL4XGL, a GDL-based classifier that learns models by program synthesis (top-down and bottom-up) and returns the synthesised GDL program as a provably… | ||
| Return of CFA: Call-Site Sensitivity Can Be Superior to Object Sensitivity Even | POPL 2022 | 2022-01-16 |
Paper claims call-site sensitivity with context tunneling can be strictly more precise and more scalable than object sensitivity, and demonstrates a toolchain… | ||
| Learning Graph-Based Heuristics for Pointer Analysis without Handcrafting Application-Specific Featu | OOPSLA 2020 | 2020-11-15 |
Graphick automatically generates graph-based context-sensitivity and heap-abstraction heuristics by learning feature sequences over program graphs… | ||
| Precise and Scalable Points-to Analysis via Data-Driven Context Tunneling | OOPSLA 2018 | 2018-11-07 |
Presents a concrete method called context tunneling that selectively preserves “important” context elements instead of the most-recent k, implemented in the… | ||
| nothing matches | ||