TY  - JOUR
A1  - Möller, Bernhard
A1  - O’Hearn, Peter
A1  - Hoare, Tony
T1  - On algebra of program correctness and incorrectness
T2  - Lecture Notes in Computer Science
N2  - Variants of Kleene algebra have been used to provide foundations of reasoning about programs, for instance by representing HoareLogic (HL) in algebra. That work has generally emphasised program correctness, i.e., proving the absence of bugs. Recently, Incorrectness Logic (IL) has been advanced as a formalism for the dual problem: proving thepresence of bugs. IL is intended to underpin the use of logic in programtesting and static bug finding. Here, we use a Kleene algebra with diamond operators and countable joins of tests, which embeds IL, and which also is complete for reasoning about the image of the embedding. Next to embedding IL, the algebra is able to embed HL, and allows making connections between IL and HL specifications. In this sense, it unifies correctness and incorrectness reasoning in one formalism
Y1  - 2021
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/90827
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-908274
SN  - 978-3-030-88700-1
SN  - 0302-9743
SN  - 1611-3349
N1  - Relational and Algebraic Methods in Computer Science: 19th International Conference, RAMiCS 2021, Marseille, France, November 2–5, 2021, Proceedings
VL  - 13027
SP  - 325
EP  - 343
PB  - Springer
CY  - Cham
ER  -