Ryosuke Sato
where else to find them
no profile links on file
what they talk about
where they keep going back
- SAS2 editions2021–2025
all 8 in the filters
on a stage with
all 13 in the filters
who talks about the same things
- Naoki Kobayashi17 talks
- Takeshi Tsukada16 talks
- Hiroyuki Katsura5 talks
- Hiroshi Unno18 talks
- Tachio Terauchi4 talks
- Taro Sekiyama12 talks
| title | conference | date |
|---|---|---|
| Solvable Tuple Patterns and Their Applications to Program Verification | PLDI 2026 | 2026-06-15 |
Introduces solvable tuple patterns (STPs) and conjunctive STPs as a representation for relations among sequences that are learnable from only positive samples… | ||
| 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… | ||
| Productivity Verification for Functional Programs by Reduction to Termination Ve... | PEPM 2024 | 2024-01-16 |
Method translates coinductive values into functions that take a path (integer list) and returns the element, turning productivity into reduction to termination… | ||
| 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… | ||
| Higher-Order Property-Directed Reachability | ICFP 2023 | 2023-09-04 |
Formalizes a higher-order extension of PDR that extends PDR to nu-HFL(Z) so transition systems can be described by higher-order recursive functions, implements… | ||
| HFL(Z) Validity Checking for Automated Program Verification | POPL 2023 | 2023-01-15 |
Proposes an automated validity checker for HFL(Z) formulas that encodes higher-order program verification (termination, nontermination, fair variants… | ||
| 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 | ||