Zobrazeno 1 - 10
of 12 108
pro vyhledávání: '"P. Hoare"'
Autor:
Ying, Mingsheng
In this paper, we present a Hoare-style logic for reasoning about quantum programs with classical variables. Our approach offers several improvements over previous work: (1) Enhanced expressivity of the programming language: Our logic applies to quan
Externí odkaz:
http://arxiv.org/abs/2412.09869
Autor:
Zimmerman, Conrad, DiVincenzo, Jenna
Previously, gradual verification has been developed using overapproximating logics such as Hoare logic. We show that the static verification component of gradual verification is also connected to underapproximating logics like incorrectness logic. To
Externí odkaz:
http://arxiv.org/abs/2412.00339
We study Hoare-like logics, including partial and total correctness Hoare logic, incorrectness logic, Lisbon logic, and many others through the lens of predicate transformers \`a la Dijkstra and through the lens of Kleene algebra with top and tests (
Externí odkaz:
http://arxiv.org/abs/2411.06416
We introduce eRHL, a program logic for reasoning about relational expectation properties of pairs of probabilistic programs. eRHL is quantitative, i.e., its pre- and post-conditions take values in the extended non-negative reals. Thanks to its quanti
Externí odkaz:
http://arxiv.org/abs/2407.17127
Probabilistic Hoare logic (PHL) is an extension of Hoare logic and is specifically useful in verifying randomized programs. It allows researchers to formally reason about the behavior of programs with stochastic elements, ensuring the desired probabi
Externí odkaz:
http://arxiv.org/abs/2406.16054
Quantum Hoare logic (QHL) is a formal verification tool specifically designed to ensure the correctness of quantum programs. There has been an ongoing challenge to achieve a relatively complete satisfaction-based QHL with while-loop since its incepti
Externí odkaz:
http://arxiv.org/abs/2405.01940
Automated verification of all members of a (potentially infinite) set of programs has the potential to be useful in program synthesis, as well as in verification of dynamically loaded code, concurrent code, and language properties. Existing technique
Externí odkaz:
http://arxiv.org/abs/2401.13244
Autor:
Kamburjan, Eduard, Gurov, Dilian
Programs must be correct with respect to their application domain. Yet, the program specification and verification approaches so far only consider correctness in terms of computations. In this work, we present a two-tier Hoare Logic that integrates a
Externí odkaz:
http://arxiv.org/abs/2402.00452
Autor:
Verscht, Lena, Kaminski, Benjamin
We aim at a holistic perspective on program logics, including Hoare and incorrectness logics. To this end, we study different classes of properties arising from the generalization of the aforementioned logics. We compare our results with the properti
Externí odkaz:
http://arxiv.org/abs/2312.09662
Autor:
Hou, Huijun, Li, Qingguo
A commutativity result for the Hoare power construction and a modified version of the Smyth power construction on all US-admitting dcpos has been confirmed in [11], where the property of being US-admitting determined by the strongly compact subsets i
Externí odkaz:
http://arxiv.org/abs/2311.14261