Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Yamada, Akihisa"'
This report contains the proceedings of the 19th International Workshop on Termination (WST 2023), which was held in Obergurgl during August 24--25 as part of Obergurgl Summer on Rewriting (OSR 2023).
Externí odkaz:
http://arxiv.org/abs/2308.09536
Autor:
Hasuo, Ichiro, Eberhart, Clovis, Haydon, James, Dubut, Jérémy, Bohrer, Rose, Kobayashi, Tsutomu, Pruekprasert, Sasinee, Zhang, Xiao-Yi, Pallas, Erik André, Yamada, Akihisa, Suenaga, Kohei, Ishikawa, Fuyuki, Kamijo, Kenji, Shinya, Yoshiyuki, Suetomi, Takamasa
We introduce a goal-aware extension of responsibility-sensitive safety (RSS), a recent methodology for rule-based safety guarantee for automated driving systems (ADS). Making RSS rules guarantee goal achievement -- in addition to collision avoidance
Externí odkaz:
http://arxiv.org/abs/2207.02387
Autor:
Eberhart, Clovis, Yamada, Akihisa, Klikovits, Stefan, Katsumata, Shin-ya, Kobayashi, Tsutomu, Hasuo, Ichiro, Ishikawa, Fuyuki
Publikováno v:
Lecture Notes in Computer Science book series (LNCS, volume 12740), 2021, pp 22-38
We introduce a new logic named Quantitative Confidence Logic (QCL) that quantifies the level of confidence one has in the conclusion of a proof. By translating a fault tree representing a system's architecture to a proof, we show how to use QCL to gi
Externí odkaz:
http://arxiv.org/abs/2107.10948
Autor:
Dubut, Jérémy, Yamada, Akihisa
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (February 4, 2022) lmcs:6809
In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or attractivity, a
Externí odkaz:
http://arxiv.org/abs/2009.13065
Autor:
Kolčák, Juraj, Hasuo, Ichiro, Dubut, Jérémy, Katsumata, Shin-ya, Sprunger, David, Yamada, Akihisa
In the field of quality assurance of hybrid systems (that combine continuous physical dynamics and discrete digital control), Platzer's differential dynamic logic (dL) is widely recognized as a deductive verification method with solid mathematical fo
Externí odkaz:
http://arxiv.org/abs/1903.00153
We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite systems a
Externí odkaz:
http://arxiv.org/abs/1802.09774
Autor:
山田, 晃久, Yamada, Akihisa
名古屋大学博士学位論文 学位の種類:博士(情報科学) 学位授与年月日:2014-09-29
Externí odkaz:
http://hdl.handle.net/2237/20647
This paper describes the implementation and techniques of the Nagoya Termination Tool, a termination prover for term rewrite systems. The main features of the tool are: the first implementation of the weighted path order which subsumes most of the ex
Externí odkaz:
http://arxiv.org/abs/1404.6626
We introduce a reduction order called the weighted path order (WPO) that subsumes many existing reduction orders. WPO compares weights of terms as in the Knuth-Bendix order (KBO), while WPO allows weights to be computed by a wide class of interpretat
Externí odkaz:
http://arxiv.org/abs/1404.6245
Publikováno v:
Theory and Practice of Logic Programming 16 (2016) 163-188
Equational theories that contain axioms expressing associativity and commutativity (AC) of certain operators are ubiquitous. Theorem proving methods in such theories rely on well-founded orders that are compatible with the AC axioms. In this paper we
Externí odkaz:
http://arxiv.org/abs/1403.0406