Separation logic

P O'Hearn - Communications of the ACM, 2019 - dl.acm.org
Separation logic Page 1 86 COMMUNICATIONS OF THE ACM | FEBRUARY 2019 | VOL. 62 |
NO. 2 review articles A FUNDAMENTAL TECHNIQUE in reasoning about programs is the use …

Incorrectness logic

PW O'Hearn - Proceedings of the ACM on Programming Languages, 2019 - dl.acm.org
Program correctness and incorrectness are two sides of the same coin. As a programmer,
even if you would like to have correctness, you might find yourself spending most of your …

Continuous reasoning: Scaling the impact of formal methods

PW O'Hearn - Proceedings of the 33rd annual ACM/IEEE symposium …, 2018 - dl.acm.org
This paper describes work in continuous reasoning, where formal reasoning about a
(changing) codebase is done in a fashion which mirrors the iterative, continuous model of …

Concurrent separation logic

S Brookes, PW O'Hearn - ACM SIGLOG News, 2016 - dl.acm.org
Concurrent Separation Logic (CSL) was originally advanced in papers of the authors
published in Theoretical Computer Science for John Reynolds's 70th Birthday Festschrift …

On algebra of program correctness and incorrectness

B Möller, P O'Hearn, T Hoare - … 2021, Marseille, France, November 2–5 …, 2021 - Springer
Variants of Kleene algebra have been used to provide foundations of reasoning about
programs, for instance by representing Hoare Logic (HL) in algebra. That work has generally …

[PDF][PDF] On the algebraic structure of Weihrauch degrees

V Brattka, A Pauly - Logical Methods in Computer Science, 2018 - lmcs.episciences.org
We introduce two new operations (compositional products and implication) on Weihrauch
degrees, and investigate the overall algebraic structure. The validity of the various …

Unifying operational weak memory verification: an axiomatic approach

S Doherty, S Dalvandi, B Dongol… - ACM Transactions on …, 2022 - dl.acm.org
In this article, we propose an approach to program verification using an abstract
characterisation of weak memory models. Our approach is based on a hierarchical axiom …

Catoids and modal convolution algebras

U Fahrenberg, C Johansen, G Struth, K Ziemiański - Algebra universalis, 2023 - Springer
We show how modal quantales arise as convolution algebras QX of functions from catoids
X, multisemigroups equipped with source and target maps, into modal quantales value or …

Formal specification and verification of reusable communication models for distributed systems architecture

Q Rouland, B Hamid, J Jaskolka - Future Generation Computer Systems, 2020 - Elsevier
The development of distributed computing systems involves complex concerns related to
integrating numerous communication styles, technologies (Internet of Things, cloud, big …

A Demonic Outcome Logic for Randomized Nondeterminism

N Zilberstein, D Kozen, A Silva, J Tassarotti - arXiv preprint arXiv …, 2024 - arxiv.org
Programs increasingly rely on randomization in applications such as cryptography and
machine learning. Analyzing randomized programs has been a fruitful research direction …