Kyungmin Bae
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
- FTSCS2 editions2022–2023
on a stage with
- Jaeseo Lee2×
- Byeongjee Kangonce
- Byoungho Sononce
all 9 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| A Formal Executable Semantics of PROMELA | VMCAI 2026 | 2026-01-12 |
Provides an executable, interpreter-like semantics of PROMELA mechanized in the K framework and based on a new Load-and-Fire pattern over forked continuations… | ||
| Formal Analysis of Networked PLC Controllers Interacting with Physical Environments | SAS 2025 | 2025-10-13 |
A unified, executable semantics combines K-based semantics for PLC programs, rewrite-based real-time ticks for continuous dynamics and an object model for… | ||
| Opening, Keynote: Bounded STL Model Checking for Hybrid Systems | FTSCS 2023 | 2023-10-22 |
Introduces a bounded STL model checking approach that reduces STL satisfiability to first‑order SMT: a STLmc bounded SMT checker encodes K variable “change… | ||
| Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata | FTSCS 2022 | 2022-12-07 |
Rewriting-logic encoding of parametric timed automata yields a Maude-with-SMT symbolic reachability procedure that is proven sound and complete for PTA… | ||
| Symbolic Reachability Analysis of Distributed Systems using Narrowing and Heuristic Search | FTSCS 2022 | 2022-12-07 |
Proposes a narrowing-based reachability method guided by a heuristic scoring function (G for path cost plus H for error likelihood) that targets… | ||
| Bounded Model Checking of PLC ST Programs using Rewriting Modulo SMT | FTSCS 2022 | 2022-12-07 |
Extends ST semantics to model scan cycles, program scheduling and timers so PLC behavior is cyclic and time-aware, then reduces LTL model checking to… | ||
| nothing matches | ||