Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Theory of computation → Hoare logic"'
Over-approximating (OX) program logics, such as separation logic (SL), are used for verifying properties of heap-manipulating programs: all terminating behaviour is characterised, but established results and errors need not be reachable. OX function
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00193445dbb70cf26180e88cfae381e0
This paper contributes to the verification of programs written in Bitcoin's smart contract language SCRIPT in the interactive theorem prover Agda. It focuses on the security property of access control for SCRIPT programs that govern the distribution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c6d6d81d4661edb7b8b9f695f8d9fcd
https://cronfa.swan.ac.uk/Record/cronfa60178/Download/60178__25491__cf880e484fd94516b2ef2fb9e21cc884.pdf
https://cronfa.swan.ac.uk/Record/cronfa60178/Download/60178__25491__cf880e484fd94516b2ef2fb9e21cc884.pdf
Autor:
Li, Yangjia, Unruh, Dominique
Publikováno v:
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
We present a variant of the quantum relational Hoare logic from (Unruh, POPL 2019) that allows us to use "expectations" in pre- and postconditions. That is, when reasoning about pairs of programs, our logic allows us to quantitatively reason about ho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3be48c319d9794f4d8095cde518b572d
https://doi.org/10.4230/lipics.icalp.2021.136
https://doi.org/10.4230/lipics.icalp.2021.136
The paper "Owicki-Gries Reasoning for C11 RAR" introduces a new proof calculus for the C11 RAR memory model that allows Owicki-Gries proof rules for compound statements, including non-interference, to remain unchanged. The proof method features novel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54e3ccda332f86558823f552df91031a
Owicki-Gries reasoning for concurrent programs uses Hoare logic together with an interference freedom rule for concurrency. In this paper, we develop a new proof calculus for the C11 RAR memory model (a fragment of C11 with both relaxed and release-a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7089f1c1aad0c9d95c039e50134b129d