Simplified and verified: a second look at a proof-producing union-find algorithm
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 7649969 (Why is no real title available?)
- A graph library for Isabelle
- A verified decision procedure for orders in Isabelle/HOL
- An improved equivalence algorithm
- Applying data refinement for monadic programs to Hopcroft's algorithm
- Efficiency of a Good But Not Linear Set Union Algorithm
- Fast congruence closure and extensions
- Faster, higher, stronger: E 2.3
- Imperative Functional Programming with Isabelle/HOL
- Isabelle/HOL. A proof assistant for higher-order logic
- Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Refinement to imperative HOL
- Simplification by Cooperating Decision Procedures
- Term Rewriting and Applications
- Types for Proofs and Programs
- Verified Textbook Algorithms
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
- Worst-case Analysis of Set Union Algorithms
This page was built for publication: Simplified and verified: a second look at a proof-producing union-find algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869949)