Ken Sakayori

According to our database, Ken Sakayori authored at least 15 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

On the Relationship between Dijkstra Monads and Higher-Order Fixpoint Logic.

Risa Yamada, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato

Dataset, January, 2025

Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types.

Hiroyuki Katsura, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato

Proceedings of the Static Analysis - 32nd International Symposium, 2025

On the Relationship between Dijkstra Monads and Higher-Order Fixpoint Logic.

Risa Yamada, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato

Proceedings of the Programming Languages and Systems, 2025

2024

Mode-based Reduction from Validity Checking of Fixpoint Logic Formulas to Test-Friendly Reachability Problem.

Hiroyuki Katsura, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato

Dataset, August, 2024

Borrowable Fractional Ownership Types for Verification.

Takashi Nakayama, Yusuke Matsushita, Ken Sakayori, Ryosuke Sato, Naoki Kobayashi

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

Ownership Types for Verification of Programs with Pointer Arithmetic.

Izumi Tanaka, Ken Sakayori, Naoki Kobayashi

Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation, 2024

Mode-based Reduction from Validity Checking of Fixpoint Logic Formulas to Test-Friendly Reachability Problem.

Hiroyuki Katsura, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato

Proceedings of the Programming Languages and Systems - 22nd Asian Symposium, 2024

2023

Extensional and Non-extensional Functions as Processes.

Ken Sakayori, Davide Sangiorgi

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2021

Symbolic Automatic Relations and Their Applications to SMT and CHC Solving.

Takumi Shimoda, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato

Dataset, July, 2021

Termination Analysis for the π-Calculus by Reduction to Sequential Program Termination.

Tsubasa Shoshi, Takuma Ishikawa, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato, Takeshi Tsukada

CoRR, 2021

Symbolic Automatic Relations and Their Applications to SMT and CHC Solving.

Takumi Shimoda, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato

Proceedings of the Static Analysis - 28th International Symposium, 2021

Output Without Delay: A π-Calculus Compatible with Categorical Semantics.

Ken Sakayori, Takeshi Tsukada

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination.

Tsubasa Shoshi, Takuma Ishikawa, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato, Takeshi Tsukada

Proceedings of the Programming Languages and Systems - 19th Asian Symposium, 2021

2019

A Categorical Model of an \mathbf i/o -typed \pi -calculus.

Ken Sakayori, Takeshi Tsukada

Proceedings of the Programming Languages and Systems, 2019

2017

A Truly Concurrent Game Model of the Asynchronous \pi -Calculus.

Ken Sakayori, Takeshi Tsukada

Proceedings of the Foundations of Software Science and Computation Structures, 2017