1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.LO2024
Extensional and Non-extensional Functions as Processes
Ken Sakayori, Davide Sangiorgi
Following Milner's seminal paper, the representation of functions as processes has received considerable attention. For pure -calculus, the process representations yield (at bes…
cs.PL2021★ 1 cited
Termination Analysis for the -Calculus by Reduction to Sequential Program Termination
Tsubasa Shoshi, Takuma Ishikawa, Naoki Kobayashi +3
We propose an automated method for proving termination of -calculus processes, based on a reduction to termination of sequential programs: we translate a -calculus process to…
cs.LO2021★ 1 cited
Symbolic Automatic Relations and Their Applications to SMT and CHC Solving
Takumi Shimoda, Naoki Kobayashi, Ken Sakayori +1
Despite the recent advance of automated program verification, reasoning about recursive data structures remains as a challenge for verification tools and their backends such as SMT…