The following pages link to Relation-algebraic semantics (Q1350513):
Displaying 17 items.
- Nondeterministic semantics of compound diagrams (Q258605) (← links)
- Completeness of fair ASM refinement (Q541210) (← links)
- Fixpoints for general correctness (Q549677) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Verifying minimum spanning tree algorithms with Stone relation algebras (Q1994364) (← links)
- Monoids with tests and the algebra of possibly non-halting programs (Q2258843) (← links)
- Infinite executions of lazy and strict computations (Q2347906) (← links)
- Normal forms for binary relations (Q2503327) (← links)
- Relational Semantics Revisited (Q2810687) (← links)
- Unifying Lazy and Strict Computations (Q2915133) (← links)
- Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm (Q3179390) (← links)
- A Relation Algebraic Semantics for a Lazy Functional Logic Language (Q3498404) (← links)
- On Automating the Calculus of Relations (Q3541686) (← links)
- Positive Fork Graph Calculus (Q3605526) (← links)
- (Q4612556) (← links)
- Stone Relation Algebras (Q5283207) (← links)
- Completeness of ASM Refinement (Q5403462) (← links)
