Relational Disjoint-Set Forests
From MaRDI portal
- A completeness theorem for Kleene algebras and the algebra of regular events
- An improved equivalence algorithm
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
- Dijkstra, Floyd and Warshall meet Kleene
- Efficiency of a Good But Not Linear Set Union Algorithm
- Graphs, dioids and semirings. New models and algorithms.
- Unnamed Publication
- Unnamed Publication
- Live data structures in logic programs. Derivation by means of abstract interpretation
- On automated program construction and verification
- On the calculus of relations.
- Refinement Calculus
- Regular Algebra Applied to Path-finding Problems
- Verifying asymptotic time complexity of imperative programs in Isabelle
- Verifying minimum spanning tree algorithms with Stone relation algebras
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
This page was built for software: Relational Disjoint-Set Forests
