Relation-algebraic verification of disjoint-set forests

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
Towards pointer algebra
Building program construction and verification tools from algebraic principles
Relational algebraic semantics of deterministic and nondeterministic programs
Winskel is (almost) right: Towards a mechanized semantics textbook
Reasoning algebraically about loops
Formal program development. IFIP TC2/WG 2.1 State-of-the-Art report
A completeness theorem for Kleene algebras and the algebra of regular events
Relation-algebraic semantics
Isabelle/HOL. A proof assistant for higher-order logic
An algebraic framework for minimum spanning tree problems
Verifying asymptotic time complexity of imperative programs in Isabelle
Relational and Kleene-algebraic methods in computer science. 7th international seminar on relational methods in computer science (RelMiCS 7) and 2nd international workshop on applications of Kleene algebra, Bad Malente, Germany, May 12-17, 2003. Revised selected papers
Dijkstra, Floyd and Warshall meet Kleene
Calculating with acyclic and cyclic lists
Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
Verifying minimum spanning tree algorithms with Stone relation algebras
Graphs, dioids and semirings. New models and algorithms.
On Automated Program Construction and Verification
Worst-case Analysis of Set Union Algorithms
Regular Algebra Applied to Path-finding Problems
Reasoning about arrays
Refinement Calculus
Refinement
A Relation-Algebraic Treatment of the Dedekind Recursion Theorem
Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
An improved equivalence algorithm
On the Cardinality of Relations
An axiomatic basis for computer programming
On the calculus of relations

This page was built for publication: Relation-algebraic verification of disjoint-set forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614547)