Algebra of monotonic Boolean transformers
From MaRDI portal
Recommendations
Cites work
- Algebraic separation logic
- An algebraic treatment of procedure refinement to support mechanical verification
- An axiomatic basis for computer programming
- Concurrent Kleene Algebra
- Data refinement of invariant based programs
- Duality in specification languages: A lattice-theoretical approach
- Enabledness and termination in refinement algebra
- Frame rule for mutually recursive procedures manipulating pointers
- scientific article; zbMATH DE number 3705887 (Why is no real title available?)
- scientific article; zbMATH DE number 3757681 (Why is no real title available?)
- scientific article; zbMATH DE number 46740 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 2090029 (Why is no real title available?)
- Isabelle/HOL. A proof assistant for higher-order logic
- Kleene algebra with domain
- Modelling angelic and demonic nondeterminism with multirelations
- Refinement algebra for probabilistic programs
- Refinement Calculus
- Towards a refinement algebra
Cited in
(11)- A relation-algebraic approach to multirelations and predicate transformers
- A program construction and verification tool for separation logic
- Stone Algebras
- An algebraic approach to multirelations and their properties
- Quantales
- Transformer semantics
- Formalization of Refinement Calculus for Reactive Systems
- Properties of Orderings and Lattices
- Kleene Algebra with Tests and Demonic Refinement Algebras
- Algebra of Monotonic Boolean Transformers
- Predicate transformer semantics for hybrid systems. Verification components for Isabelle/HOL
This page was built for publication: Algebra of monotonic Boolean transformers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098056)