The following pages link to The weakest prespecification (Q1091121):
Displaying 25 items.
- A relation-algebraic approach to the ``Hoare logic'' of functional dependencies (Q406457) (← links)
- Prespecification in data refinement (Q578901) (← links)
- An elementary and unified approach to program correctness (Q607408) (← links)
- Representation theorems for \(Q\)-algebras (Q666689) (← links)
- Embedding a demonic semilattice in a relation algebra (Q672711) (← links)
- Free quantaloids (Q805732) (← links)
- Angelic nondeterminism in the unifying theories of programming (Q851128) (← links)
- Process simulation and refinement (Q911322) (← links)
- Inductive data types for predicate transformers (Q1199549) (← links)
- A representation theorem for quantales (Q1208239) (← links)
- Normal form approach to compiler design (Q1323320) (← links)
- Peirce algebras (Q1333408) (← links)
- Towards automating duality (Q1343394) (← links)
- Semantic distance between specifications (Q1583257) (← links)
- The logic of Peirce algebras (Q1909608) (← links)
- Relations and non-commutative linear logic (Q1910723) (← links)
- Towards reasoning about Hoare relations (Q1924753) (← links)
- A relational division operator: The conjugate kernel (Q2367540) (← links)
- Gentzen-type calculi for involutive quantales (Q2575479) (← links)
- Automated reasoning for probabilistic sequential programs with theorem proving (Q2695373) (← links)
- A Relation-Algebraic Approach to Multirelations and Predicate Transformers (Q2941166) (← links)
- Relational Decomposition (Q3087994) (← links)
- Quantales, observational logic and process semantics (Q4279244) (← links)
- Autonomous posets and quantales (Q4304551) (← links)
- Formally verified animation for RoboChart using interaction trees (Q6151624) (← links)
