Kanghee Park
where else to find them
no profile links on file
what they talk about
where they keep going back
- OOPSLA2 editions2023–2025
on a stage with
- Loris D'Antoni2×
- Thomas Repsonce
- Xuanyu Pengonce
who talks about the same things
- Xuanyu Peng3 talks
- Loris D'Antoni17 talks
- Xiaokang Qiu6 talks
- Yingfei Xiong9 talks
- Kihong Heo2 talks
- Thomas Reps20 talks
| title | conference | date |
|---|---|---|
| LOUD: Synthesizing Strongest and Weakest Specifications | OOPSLA 2025 | 2025-10-16 |
The paper presents LOUD, a logic and algorithm that synthesizes strongest L-consequences (over-approximations) and weakest L-implicants (under-approximations)… | ||
| Synthesizing Specifications | OOPSLA 2023 | 2023-10-23 |
Algorithm synthesizes all best L-properties that are sound, precise (no strictly more precise L-property exists), and complete (no further L-properties can… | ||
| nothing matches | ||