Xiaohong Chen
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- Grigore Rosu2×
- Jonathan DiLorenzoonce
- Lucas Peñaonce
all 8 in the filters
who talks about the same things
- Minh-Thai Trinh2 talks
- Lucas Peña3 talks
- Grigore Rosu11 talks
- Yu Gu3 talks
- Hiroshi Unno18 talks
- Yanning Chen2 talks
| title | conference | date |
|---|---|---|
| Panel: Mechanized Specifications for Real-World Programming Languages | RPLS 2025 | 2025-06-17 |
Panelists contrast concrete outcomes: an K framework built for engineering-first, executable semantics; a call for a usable symbolic executor for P4 that can… | ||
| Programming Languages Must Have Formal Semantics. Period. | RPLS 2025 | 2025-06-17 |
Argues that every language gets a machine-checkable formal semantics first and that all tools—interpreter, compiler, verifier, model checker—are automatically… | ||
| Towards a Unified Proof Framework for Automated Fixpoint Reasoning using Matching Logic | OOPSLA 2020 | 2020-11-15 |
A unified proof framework uses matching logic as a base to build automated provers for multiple logics, implementing 11 generic rules (including LFP based on… | ||
| A General Approach to Define Binders Using Matching Logic | ICFP 2020 | 2020-08-23 |
Defines binders by using matching logic’s built‑in exists to form the graph set [X]E and then a constructor to build the binder term, encapsulated as the… | ||
| nothing matches | ||