Pages that link to "Item:Q1961862"
From MaRDI portal
The following pages link to Combining relational calculus and the Dijkstra-Gries method for deriving relational programs (Q1961862):
Displaying 13 items.
- Applying relation algebra and RelView to solve problems on orders and lattices (Q929300) (← links)
- Relational heuristics for the design of deterministic programs (Q1077919) (← links)
- Deriving relational programs for computing kernels by reconstructing a proof of Richardson's theorem (Q1581059) (← links)
- Two graph algorithms derived (Q1818303) (← links)
- A relational calculus for program construction by parts (Q1916368) (← links)
- Relational characterisations of paths (Q2210868) (← links)
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures (Q2347907) (← links)
- Second-order properties of undirected graphs (Q2695354) (← links)
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras (Q5098718) (← links)
- Completeness of a relational calculus for program schemes (Q5940932) (← links)
- Cardinality of relations and relational approximation algorithms (Q5963086) (← links)
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF (Q6132415) (← links)
- Relation-algebraic verification of disjoint-set forests (Q6614547) (← links)