The weakest prespecification
From MaRDI portal
Recommendations
Cites work
Cited in
(35)- Quantales, observational logic and process semantics
- scientific article; zbMATH DE number 3974258 (Why is no real title available?)
- scientific article; zbMATH DE number 4020448 (Why is no real title available?)
- Inductive data types for predicate transformers
- A relation-algebraic approach to the ``Hoare logic of functional dependencies
- Proof system for weakest prespecification
- Embedding a demonic semilattice in a relation algebra
- Relations and non-commutative linear logic
- Formally verified animation for RoboChart using interaction trees
- Angelic nondeterminism in the unifying theories of programming
- Automated reasoning for probabilistic sequential programs with theorem proving
- A relation-algebraic approach to multirelations and predicate transformers
- Unambiguous Büchi Is Weak
- Representation theorems for \(Q\)-algebras
- Free quantaloids
- Towards reasoning about Hoare relations
- The logic of Peirce algebras
- scientific article; zbMATH DE number 4068837 (Why is no real title available?)
- scientific article; zbMATH DE number 8784 (Why is no real title available?)
- An elementary and unified approach to program correctness
- The weakest specifunction
- Process simulation and refinement
- A relational division operator: The conjugate kernel
- Normal form approach to compiler design
- Peirce algebras
- Gentzen-type calculi for involutive quantales
- Autonomous posets and quantales
- A representation theorem for quantales
- Towards automating duality
- Relational decomposition
- A Weakest Precondition Semantics for Z
- Assume-guarantee reasoning for additive hybrid behaviour
- Prespecification in data refinement
- Jifeng He at Oxford and beyond: an appreciation
- Semantic distance between specifications
This page was built for publication: The weakest prespecification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091121)
