Zobrazeno 1 - 10
of 1 746
pro vyhledávání: '"KOBAYASHI, Naoki"'
Autor:
Kobayashi, Naoki
The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undecidable for a slight extension of
Externí odkaz:
http://arxiv.org/abs/2411.06086
Toman et al. have proposed a type system for automatic verification of low-level programs, which combines ownership types and refinement types to enable strong updates of refinement types in the presence of pointer aliases. We extend their type syste
Externí odkaz:
http://arxiv.org/abs/2312.06455
Automated verification of functional correctness of imperative programs with references (a.k.a. pointers) is challenging because of reference aliasing. Ownership types have recently been applied to address this issue, but the existing approaches were
Externí odkaz:
http://arxiv.org/abs/2310.20430
Autor:
Kobayashi, Naoki
The transportation sector in Japan in FY 2019 accounted for 18.6% of total CO2 emissions in Japan. In particular, passenger cars accounted for 8.5% of total CO2 emissions. To decrease CO2 emissions, The adoption of clean energy vehicles such as Batte
Externí odkaz:
https://hdl.handle.net/1721.1/144520
To promote and further develop RST-style discourse parsing models, we need a strong baseline that can be regarded as a reference for reporting reliable experimental results. This paper explores a strong baseline by integrating existing simple parsing
Externí odkaz:
http://arxiv.org/abs/2210.08355
We consider the reachability problem for higher-order functional programs and study the relationship between reachability games (i.e., the reachability problem for programs with angelic and demonic nondeterminism) and may-reachability (i.e., the reac
Externí odkaz:
http://arxiv.org/abs/2203.08416
Tensor shape mismatch is a common source of bugs in deep learning programs. We propose a new type-based approach to detect tensor shape mismatches. One of the main features of our approach is the best-effort shape inference. As the tensor shape infer
Externí odkaz:
http://arxiv.org/abs/2203.08402
We propose an automated method for checking the validity of a formula of HFL(Z), a higher-order logic with fixpoint operators and integers. Combined with Kobayashi et al.'s reduction from higher-order program verification to HFL(Z) validity checking,
Externí odkaz:
http://arxiv.org/abs/2203.07601
Autor:
Kobayashi, Naoki, Shibayama, Hitoshi
The fragment-size distributions of raw carrot diced or crushed using a food mixer are studied experimentally. For the 5-mm-square raw carrot, the normal distribution shows a characteristic feature of food fragmentation statistics. This simple result
Externí odkaz:
http://arxiv.org/abs/2110.10988
Autor:
Kobayashi, Naoki
Publikováno v:
EPTCS 344, 2021, pp. 1-12
In this article, we give an overview of our project on higher-order program verification based on HFL (higher-order fixpoint logic) model checking. After a brief introduction to HFL, we explain how it can be applied to program verification, and summa
Externí odkaz:
http://arxiv.org/abs/2109.04629