Hakjoo Oh
where else to find them
linkedin:lukaszkaiser
what they talk about
all 6 in the filters
where they keep going back
on a stage with
all 12 in the filters
who talks about the same things
- Minseok Jeon6 talks
- Myungho Lee4 talks
- Sukyoung Ryu12 talks
- Chan Gu Kang3 talks
- Jeehoon Kang14 talks
- Zhendong Su25 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… | ||
| Enhancing APR with PRISM: A Semantic-Based Approach to Overfitting Patch Detection | OOPSLA 2025 | 2025-10-16 |
PRISM builds a custom static analyzer that extracts 11 semantic properties (defs/uses, memory values, exceptions) and represents patches as a semantic feature… | ||
| Statistical Testing of Quantum Programs via Fixed-Point Amplitude Amplification | OOPSLA 2024 | 2024-10-20 |
Proposes using fixed-point amplitude amplification to reduce the number of runs needed to statistically detect wrong output states, claiming reductions like… | ||
| 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… | ||
| 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… | ||
| Modular Component-Based Quantum Circuit Synthesis | OOPSLA 2023 | 2023-10-23 |
A synthesizer constructs quantum circuits from user-supplied component gates by performing enumerative search with pruning at the module-level search (modules… | ||
| Data-driven program analysis | POPL 2022 Virtual Workshop | 2022-01-27 |
A data-driven static-analysis pipeline is presented that learns program abstractions (which variables get flow sensitivity, which functions get k‑CFA) by… | ||
| 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… | ||
| nothing matches | ||