Pages that link to "Item:Q3575262"
From MaRDI portal
The following pages link to On Automated Program Construction and Verification (Q3575262):
Displayed 8 items.
- Cardinality of relations with applications (Q738869) (← 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)
- Using relation-algebraic means and tool support for investigating and computing bipartitions (Q2360655) (← links)
- Second-order properties of undirected graphs (Q2695354) (← links)
- Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures (Q2915139) (← links)
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras (Q5098718) (← links)
- Cardinality of relations and relational approximation algorithms (Q5963086) (← links)