Relation algebras gain semantics for associative arrays that integrate with while-programs, enabling Isabelle/HOL proofs of correctness for disjoint-set forest implementations using union-by-rank and path compression, splitting or halving.
An Improved Equivalence Algorithm
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2023 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Relation-Algebraic Verification of Disjoint-Set Forests
Relation algebras gain semantics for associative arrays that integrate with while-programs, enabling Isabelle/HOL proofs of correctness for disjoint-set forest implementations using union-by-rank and path compression, splitting or halving.