Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyosuke Sato 0001
Person information
- affiliation: University of Tokyo, Japan
- affiliation (former): Kyushu University, Japan
- not to be confused with: Ryosuke Sato 0002
Other persons with the same name
- Ryosuke Sato 0002
![[0000-0001-9575-0514]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-9575-0514")
— University of Tokyo, Graduate School of Information Science and Technology, Department of Mathematical Informatics, Japan - Ryosuke Sato 0003 — Nippon Telegraph and Telephone Corporation, Tokyo, Japan
- Ryosuke Sato 0004 — Kyoto University, Department of Systems Science, Japan
- Ryosuke Sato 0005 — Osaka University, Japan (and 4 more)
- Ryosuke Sato 0006 — MITSUE-LINKS, Tokyo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j9]Mahmudul Faisal Al Ameen, Naoki Kobayashi, Ryosuke Sato:
Asynchronous unfold/fold transformation for fixpoint logic. Sci. Comput. Program. 231: 103014 (2024)- 2023
- [j8]Ryosuke Sato:
Refinement Types for Call-by-name Programs. J. Inf. Process. 31: 708-721 (2023) - [j7]Hiroyuki Katsura, Naoki Kobayashi, Ryosuke Sato:
Higher-Order Property-Directed Reachability. Proc. ACM Program. Lang. 7(ICFP): 48-77 (2023) - [j6]Naoki Kobayashi, Kento Tanahashi, Ryosuke Sato, Takeshi Tsukada:
HFL(Z) Validity Checking for Automated Program Verification. Proc. ACM Program. Lang. 7(POPL): 154-184 (2023) - 2022
- [j5]Yutaro Kashiwa, Ryoma Nishikawa, Yasutaka Kamei, Masanari Kondo, Emad Shihab, Ryosuke Sato, Naoyasu Ubayashi:
An empirical study on self-admitted technical debt in modern code review. Inf. Softw. Technol. 146: 106855 (2022) - 2020
- [j4]Adrien Champion, Tomoya Chiba, Naoki Kobayashi, Ryosuke Sato:
ICE-Based Refinement Type Discovery for Higher-Order Functional Programs. J. Autom. Reason. 64(7): 1393-1418 (2020) - 2017
- [j3]Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi:
Verifying relational properties of functional programs by first-order refinement. Sci. Comput. Program. 137: 2-62 (2017) - 2015
- [j2]Ryosuke Sato, Kazuyuki Asada, Naoki Kobayashi:
Refinement Type Checking via Assertion Checking. J. Inf. Process. 23(6): 827-834 (2015) - 2011
- [j1]Ryosuke Sato, Kohei Suenaga, Naoki Kobayashi:
Ordered Types for Stream Processing of Tree-Structured Data. J. Inf. Process. 19: 74-87 (2011)
Conference and Workshop Papers
- 2024
- [c26]Ren Fukaishi, Naoki Kobayashi, Ryosuke Sato:
Productivity Verification for Functional Programs by Reduction to Termination Verification. PEPM 2024: 70-82 - [c25]Takashi Nakayama, Yusuke Matsushita, Ken Sakayori, Ryosuke Sato, Naoki Kobayashi:
Borrowable Fractional Ownership Types for Verification. VMCAI (2) 2024: 224-246 - 2023
- [c24]Ryo Ikeda, Ryosuke Sato, Naoki Kobayashi:
Argument Reduction of Constrained Horn Clauses Using Equality Constraints. APLAS 2023: 246-265 - [c23]Momoko Hattori, Naoki Kobayashi, Ryosuke Sato:
Gradual Tensor Shape Checking. ESOP 2023: 197-224 - 2022
- [c22]Mahmudul Faisal Al Ameen, Naoki Kobayashi, Ryosuke Sato:
Asynchronous Unfold/Fold Transformation for Fixpoint Logic. FLOPS 2022: 39-56 - [c21]Ryoya Mukai, Naoki Kobayashi, Ryosuke Sato:
Parameterized Recursive Refinement Types for Automated Program Verification. SAS 2022: 397-421 - 2021
- [c20]Tsubasa Shoshi, Takuma Ishikawa, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato, Takeshi Tsukada:
Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination. APLAS 2021: 265-284 - [c19]Ryuta Kambe, Naoki Kobayashi, Ryosuke Sato, Ayumi Shinohara, Ryo Yoshinaka:
Inside-Outside Algorithm for Macro Grammars. ICGI 2021: 32-46 - [c18]Takumi Shimoda, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato:
Symbolic Automatic Relations and Their Applications to SMT and CHC Solving. SAS 2021: 405-428 - 2020
- [c17]Ryujiro Nishinaka, Naoyasu Ubayashi, Yasutaka Kamei, Ryosuke Sato:
How Fast and Effectively Can Code Change History Enrich Stack Overflow? QRS 2020: 467-478 - 2019
- [c16]Naoyasu Ubayashi, Takuya Watanabe, Yasutaka Kamei, Ryosuke Sato:
Git-based integrated uncertainty manager. ICSE (Companion Volume) 2019: 95-98 - [c15]Ryosuke Sato, Naoki Iwayama, Naoki Kobayashi:
Combining higher-order model checking with refinement type inference. PEPM@POPL 2019: 47-53 - [c14]Naoyasu Ubayashi, Yasutaka Kamei, Ryosuke Sato:
When and Why Do Software Developers Face Uncertainty? QRS 2019: 288-299 - 2018
- [c13]Adrien Champion, Naoki Kobayashi, Ryosuke Sato:
HoIce: An ICE-Based Non-linear Horn Clause Solver. APLAS 2018: 146-156 - [c12]Naoyasu Ubayashi, Hokuto Muraoka, Daiki Muramoto, Yasutaka Kamei, Ryosuke Sato:
Exploring uncertainty in GitHub OSS projects: when and how do developers face uncertainty? ICSE (Companion Volume) 2018: 272-273 - [c11]Naoyasu Ubayashi, Yasutaka Kamei, Ryosuke Sato:
iArch-U/MC: An Uncertainty-Aware Model Checker for Embracing Known Unknowns. ICSOFT 2018: 210-218 - [c10]Naoyasu Ubayashi, Yasutaka Kamei, Ryosuke Sato:
Modular Programming and Reasoning for Living with Uncertainty. ICSOFT (Selected Papers) 2018: 220-244 - [c9]Naoyasu Ubayashi, Yasutaka Kamei, Ryosuke Sato:
Can Abstraction Be Taught? Refactoring-based Abstraction Learning. MODELSWARD 2018: 429-437 - [c8]Adrien Champion, Tomoya Chiba, Naoki Kobayashi, Ryosuke Sato:
ICE-Based Refinement Type Discovery for Higher-Order Functional Programs. TACAS (1) 2018: 365-384 - 2017
- [c7]Ryosuke Sato, Naoki Kobayashi:
Modular Verification of Higher-Order Functional Programs. ESOP 2017: 831-854 - 2016
- [c6]Keiichi Watanabe, Ryosuke Sato, Takeshi Tsukada, Naoki Kobayashi:
Automatically disproving fair termination of higher-order functional programs. ICFP 2016: 243-255 - [c5]Akihiro Murase, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno:
Temporal verification of higher-order functional programs. POPL 2016: 57-68 - 2015
- [c4]Takuya Kuwahara, Ryosuke Sato, Hiroshi Unno, Naoki Kobayashi:
Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs. CAV (2) 2015: 287-303 - [c3]Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi:
Verifying Relational Properties of Functional Programs by First-Order Refinement. PEPM 2015: 61-72 - 2013
- [c2]Ryosuke Sato, Hiroshi Unno, Naoki Kobayashi:
Towards a scalable software model checker for higher-order programs. PEPM 2013: 53-62 - 2011
- [c1]Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno:
Predicate abstraction and CEGAR for higher-order model checking. PLDI 2011: 222-233
Informal and Other Publications
- 2023
- [i7]Ryosuke Sato:
Polyhedral Clinching Auctions with a Single Sample. CoRR abs/2302.03458 (2023) - [i6]Takashi Nakayama, Yusuke Matsushita, Ken Sakayori, Ryosuke Sato, Naoki Kobayashi:
Borrowable Fractional Ownership Types for Verification. CoRR abs/2310.20430 (2023) - 2022
- [i5]Kento Tanahashi, Naoki Kobayashi, Ryosuke Sato:
Automatic HFL(Z) Validity Checking for Program Verification. CoRR abs/2203.07601 (2022) - [i4]Momoko Hattori, Naoki Kobayashi, Ryosuke Sato:
Gradual Tensor Shape Checking. CoRR abs/2203.08402 (2022) - 2021
- [i3]Takumi Shimoda, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato:
Symbolic Automatic Relations and Their Applications to SMT and CHC Solving. CoRR abs/2108.07642 (2021) - [i2]Tsubasa Shoshi, Takuma Ishikawa, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato, Takeshi Tsukada:
Termination Analysis for the π-Calculus by Reduction to Sequential Program Termination. CoRR abs/2109.00311 (2021) - 2020
- [i1]Daito Nakano, Mingyang Yin, Ryosuke Sato, Abram Hindle, Yasutaka Kamei, Naoyasu Ubayashi:
A Quantitative Study of Security Bug Fixes of GitHub Repositories. CoRR abs/2012.08053 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
