-
Asynchronous Unfold/Fold Transformation for Fixpoint Logic
Mahmudul Faisal Al Ameen, Naoki Kobayashi, Ryosuke Sato
Science of Computer Programming. 231:103014 (2024).
-
Higher-order Property-Directed Reachability
Hiroyuki Katsura, Naoki Kobayashi, Ryosuke Sato
Proceedings of the ACM on Programming Languages. Volume 7, Issue ICFP, Article No. 190, pp 48–77. 2023.
-
Refinement types for call-by-name programs
Ryosuke Sato
Journal of Information Processing. Vol 31, 708–721 (2023).
-
HFL(Z) Validity Checking for Automated Program Verification
Naoki Kobayashi, Kento Tanahashi, Ryosuke Sato, Takeshi Tsukada
Proceedings of the ACM on Programming Languages. Volume 7, Issue POPL, Article No. 6, pp. 154–184. 2023.
-
An empirical study on self-admitted technical debt in modern code review
Yutaro Kashiwa, Ryoma Nishikawa, Yasutaka Kamei, Masanari Kondo, Emad Shihab, Ryosuke Sato, Naoyasu Ubayashi.
Information and Software Technology. 146: 106855 (2022).
-
ICE-Based Refinement Type Discovery for Higher-Order Functional Programs.
Adrien Champion, Tomoya Chiba, Naoki Kobayashi, Ryosuke Sato.
Journal on Automated Reasoning. 64(7): 1393–1418 (2020).
-
Verifying relational properties of functional programs by first-order refinement.
Kazuyuki Asada, Ryosuke Sato, Naoki Kobayashi.
Science of Computer Programming. 137: 2–62 (2017).
-
Refinement Type Checking via Assertion Checking.
Ryosuke Sato, Kazuyuki Asada, Naoki Kobayashi.
Journal of Information Processing. 23(6): 827–834 (2015).
-
Ordered Types for Stream Processing of Tree-Structured Data.
Ryosuke Sato, Kohei Suenaga, Naoki Kobayashi.
Journal of Information Processing. 19: 74–87 (2011).
-
On the Relationship between Dijkstra Monads and Higher-Order Fixpoint Logic
Risa Yamada, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato
-
Mode-based Reduction from Validity Checking of Fixpoint Logic Formulas to Test-Friendly Reachability Problem
Hiroyuki Katsura, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato
-
Productivity Verification for Functional Programs by Reduction to Termination Verification
Ren Fukaishi, Naoki Kobayashi, Ryosuke Sato
-
Borrowable Fractional Ownership Types for Verification
Takashi Nakayama, Yusuke Matsushita, Ryosuke Sato, Ken Sakayori, Naoki Kobayashi
-
Argument Reduction of Constrained Horn Clauses Using Equality Constraints
Ryo Ikeda, Ryosuke Sato, Naoki Kobayashi
-
Gradual Tensor Shape Checking
Momoko Hattori, Naoki Kobayashi, Ryosuke Sato
-
Parameterized Recursive Refinement Types for Automated Program Verification
Ryoya Mukai, Naoki Kobayashi, Ryosuke Sato
-
Asynchronous Unfold/Fold Transformation for Fixpoint Logic
Mahmudul Faisal Al Ameen, Naoki Kobayashi, Ryosuke Sato
-
Termination Analysis for the Pi-Calculus by Reduction to Sequential Program Termination
Tsubasa Shoshi, Takuma Ishikawa, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato, Takeshi Tsukada
-
Symbolic Automatic Relations and Their Applications to SMT and CHC Solving
Takumi Shimoda, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato
-
Inside-Outside Algorithm for Macro Grammars
Ryuta Kambe, Naoki Kobayashi, Ryosuke Sato, Ayumi Shinohara, Ryo Yoshinaka
In Proceedings of Machine Learning Research 153 (PMLR 2021). 2021.
-
How Fast and Effectively Can Code Change History Enrich Stack Overflow?
Ryujiro Nishinaka, Naoyasu Ubayashi, Yasutaka Kamei, Ryosuke Sato.
-
When and Why Do Software Developers Face Uncertainty?
Naoyasu Ubayashi, Yasutaka Kamei, Ryosuke Sato.
-
Combining Higher-Order Model Checking with Refinement Type Inference (short paper).
Ryosuke Sato, Naoki Iwayama, Naoki Kobayashi.
-
HoIce: A ICE-based Non-Linear Horn Clause Solver (tool paper).
Adrien Champion, Naoki Kobayashi, Ryosuke Sato.
-
iArch-U/MC: An Uncertainty-Aware Model Checker for Embracing Known Unknowns.
Naoyasu Ubayashi, Yasutaka Kamei, Ryosuke Sato.
-
ICE-based Refinement Type Discovery for Higher-Order Functional Programs.
Adrien Champion, Tomoya Chiba, Naoki Kobayashi, Ryosuke Sato.
-
Exploring uncertainty in GitHub OSS projects: when and how do developers face uncertainty?
Naoyasu Ubayashi, Hokuto Muraoka, Daiki Muramoto, Yasutaka Kamei, Ryosuke Sato.
In the 40th International Conference on Software Engineering: Companion Proceeedings (ICSE 2018), Gothenburg, Sweden, 2018.
-
Can Abstraction Be Taught? Refactoring-based Abstraction Learning.
Naoyasu Ubayashi, Yasutaka Kamei, Ryosuke Sato.
-
Modular Verification of Higher-order Functional Programs.
Ryosuke Sato, Naoki Kobayashi.
-
Automatically Disproving Fair Termination of Higher-Order Functional Programs.
Keiichi Watanabe, Ryosuke Sato, Takeshi Tsukada, Naoki Kobayashi.
-
Temporal Verification of Higher-order Functional Programs.
Akihiro Murase, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno.
-
Predicate Abstraction and CEGAR for Disproving Termination of Higher-order Functional Programs.
Takuya Kuwahara, Ryosuke Sato, Hiroshi Unno, Naoki Kobayashi.
-
Verifying Relational Properties of Functional Programs by First-Order Refinement.
Kazuyuki Asada, Ryosuke Sato, Naoki Kabayashi.
-
Towards a Scalable Software Model Checker for Higher-Order Programs.
Ryosuke Sato, Hiroshi Unno, Naoki Kabayashi.
-
Predicate Abstraction and CEGAR for Higher-Order Model Checking.
Naoki Kabayashi, Ryosuke Sato, Hiroshi Unno.
-
Ordered Types for Stream Processing of Tree-Structured Data.
Ryosuke Sato, Kohei Suenaga, Naoki Kobayashi.
-
Combining Higher-Order Model Checking with Refinement Type Inference.
Ryosuke Sato, Naoki Iwayama, Naoki Kobayashi.
The 8th Asian Workshop on Advanced Software Engineering (AWASE 2019), Fukuoka, Japan, October 2019.
-
Refinement Type Checking via Assertion Checking.
Ryosuke Sato, Kazuyuki Asada, Naoki Kobayashi.
Workshop on Higher-Order Program Analysis, Kyoto, Japan, July 2015.
-
MoCHi: Software Model Checker for a Higher-Order Functional Language.
Ryosuke Sato, Hiroshi Unno, Naoki Kobayashi.
ACM SIGPLAN Workshop on ML, Denmark, September 2012.