Zobrazeno 1 - 10
of 364 536
pro vyhledávání: '"A. Hol"'
In order to formally verify robotic controllers, we must tackle the inherent uncertainty of sensing and actuation in a physical environment. We can model uncertainty using stochastic hybrid systems, which combine discrete jumps with continuous, stoch
Externí odkaz:
http://arxiv.org/abs/2410.14718
Autor:
Sato, Tetsuya, Minamide, Yasuhiko
Differential privacy is a statistical definition of privacy that has attracted the interest of both academia and industry. Its formulations are easy to understand, but the differential privacy of databases is complicated to determine. One of the reas
Externí odkaz:
http://arxiv.org/abs/2410.15386
Mission-time Linear Temporal Logic (MLTL) is rapidly increasing in popularity as a specification logic, e.g., for runtime verification, model checking, and other formal methods, driving a need for a larger tool base for analysis of this logic. To tha
Externí odkaz:
http://arxiv.org/abs/2410.03465
Model execution allows us to prototype and analyse software engineering models by stepping through their possible behaviours, using techniques like animation and simulation. On the other hand, deductive verification allows us to construct formal proo
Externí odkaz:
http://arxiv.org/abs/2408.15817
Autor:
Binder, Sage, Kosaian, Katherine
We formalize Pick's theorem for finding the area of a simple polygon whose vertices are integral lattice points. We are inspired by John Harrison's formalization of Pick's theorem in HOL Light, but tailor our proof approach to avoid a primary challen
Externí odkaz:
http://arxiv.org/abs/2405.01793
This paper describes a formal theory of smooth vector fields, Lie groups and the Lie algebra of a Lie group in the theorem prover Isabelle. Lie groups are abstract structures that are composable, invertible and differentiable. They are pervasive as m
Externí odkaz:
http://arxiv.org/abs/2407.19211
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We present a mechanized embedding of higher-order logic (HOL) and algebraic data types (ADT) into first-order logic with ZFC axioms. We implement this in the Lisa proof assistant for schematic first-order logic and its library based on axiomatic set
Externí odkaz:
http://arxiv.org/abs/2403.13403
Publikováno v:
EPTCS 402, 2024, pp. 4-17
The foundations of formal models for epistemic and doxastic logics often rely on certain logical aspects of modal logics such as S4 and S4.2 and their semantics; however, the corresponding mathematical results are often stated in papers or books with
Externí odkaz:
http://arxiv.org/abs/2404.14919
Autor:
Parsert, Julian
Linear programming describes the problem of optimising a linear objective function over a set of constraints on its variables. In this paper we present a solver for linear programs implemented in the proof assistant Isabelle/HOL. This allows formally
Externí odkaz:
http://arxiv.org/abs/2403.19639