On algebra of program correctness and incorrectness
From MaRDI portal
Cites work
- A completeness theorem for Kleene algebras and the algebra of regular events
- Algebras of modal operators and partial correctness
- An axiomatic basis for computer programming
- An equational axiomatization of dynamic negation and relational composition
- Computer Aided Verification
- Concurrent Kleene algebra and its foundations
- Demonic operators and monotype factors
- First-order dynamic logic
- scientific article; zbMATH DE number 46487 (Why is no real title available?)
- scientific article; zbMATH DE number 1210362 (Why is no real title available?)
- scientific article; zbMATH DE number 3264018 (Why is no real title available?)
- In praise of algebra
- Kleene algebra with domain
- Local reasoning about the presence of bugs: incorrectness separation logic
- On Hoare logic and Kleene algebra with tests
- Program proving: KJumps and functions
- Reverse Hoare logic
- Ten Years of Hoare's Logic: A Survey—Part I
Cited in
(14)- Algebraic implementations preserve program correctness
- Terme, Gleichungen, Ungleichungen
- scientific article; zbMATH DE number 6613247 (Why is no real title available?)
- Algebraic models of correctness for microprocessors
- Logic for reasoning about bugs in loops over data sequences (IFIL)
- Adversarial logic
- Local completeness logic on Kleene algebra with tests
- Program correctness and matricial iteration theories
- Low-level reachability analysis based on formal logic
- Domain reasoning in TopKAT
- Some uses of modal semirings
- A correctness and incorrectness program logic
- Formalization of Hyper Hoare Logic: A Logic to (Dis-)Prove Program Hyperproperties
- Correctness criteria for algebraic closures of the estimate-calculating algorithm model
This page was built for publication: On algebra of program correctness and incorrectness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695364)
