Ken Sakayori
where else to find them
what they talk about
all 5 in the filters
where they keep going back
- SAS2 editions2021–2025
all 6 in the filters
on a stage with
all 12 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| On Circuit Description Languages, Indexed Monads, and Resource Analysis | POPL 2026 | 2026-01-11 |
Presents a monad-based denotational semantics for Proto-Quipper variants that cleanly separates returned values from the circuits a term generates, using a… | ||
| Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic(…) | SAS 2025 | 2025-10-13 |
A procedure automatically abstracts CHCs over algebraic data types to integer CHCs by synthesizing catamorphisms (generalized folds) via a CEGAR-style loop… | ||
| Ownership Types for Verification of Programs with Pointer Arithmetic | PEPM 2024 | 2024-01-16 |
Extends Toman et al.’s refinement-plus-ownership type system to handle pointer arithmetic, proves soundness, and implements a prototype tool that verifies… | ||
| Borrowable Fractional Ownership Types for Verification | VMCAI 2024 | 2024-01-15 |
Combines ConSORT’s fractional ownership and RustHorn’s borrowable (lifetime) ownership into borrowable fractional ownership types, a flow‑sensitive type system… | ||
| Termination Analysis for the pi-Calculus by Reduction to Sequential Program Termination | SPLASH 2022 | 2022-12-05 |
Proposes an automated reduction that translates pi-calculus processes into sequential C programs so termination of the C program implies termination of the… | ||
| Symbolic Automatic Relations and Their Applications to SMT and CHC Solving | SAS 2021 | 2021-10-17 |
Defines symbolic automatic relations that combine symbolic automata and automatic relations and proves they are closed under Boolean ops; shows satisfiability… | ||
| Termination Analysis for the \$\pi\$-Calculus by Reduction to Sequential Program Termination | APLAS 2021 | 2021-10-17 |
Proposes an automated reduction that translates π-calculus to C so termination of the sequential program implies termination of the original process, and… | ||
| nothing matches | ||