Algebras for program correctness in Isabelle/HOL
From MaRDI portal
Recommendations
Cited in
(17)- Automated verification of refinement laws
- Algebraic implementations preserve program correctness
- Modal Kleene algebra applied to program correctness
- A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency
- Developments in concurrent Kleene algebra
- A while program normal form theorem in total correctness
- scientific article; zbMATH DE number 3986619 (Why is no real title available?)
- scientific article; zbMATH DE number 2090029 (Why is no real title available?)
- Reasoning About Algebraic Structures with Implicit Carriers in Isabelle/HOL
- Kleene algebra with tests and Coq tools for while programs
- Program analysis and verification based on Kleene algebra in Isabelle/HOL
- Normal forms in total correctness for while programs and action systems
- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs
- Specifying and reasoning about shared-variable concurrency
- A Coq implementation of the program algebra in Jifeng He's new roadmap for linking theories of programming
- Building program construction and verification tools from algebraic principles
- Algebras of modal operators and partial correctness
This page was built for publication: Algebras for program correctness in Isabelle/HOL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5410477)