Verification of the Schorr-Waite algorithm -- from trees to graphs
From MaRDI portal
Recommendations
- Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
- Correctness of Pointer Manipulating Algorithms Illustrated by a Verified BDD Construction
- Proving pointer programs in higher-order logic
- Proving pointer programs in higher-order logic.
- Verified efficient implementation of Gabow's strongly connected component algorithm
Cites work
- An efficient machine-independent procedure for garbage collection in various list structures
- Correctness of Pointer Manipulating Algorithms Illustrated by a Verified BDD Construction
- Experience report: seL4, formally verifying a high-performance microkernel
- Imperative Functional Programming with Isabelle/HOL
- Isabelle/HOL. A proof assistant for higher-order logic
- Local reasoning about programs that alter data structures
- Proving pointer programs in higher-order logic
- Proving pointer programs in Hoare logic
- The Zipper
- Verification of the Schorr-Waite algorithm -- from trees to graphs
Cited in
(5)- Verified efficient implementation of Gabow's strongly connected component algorithm
- Verification of the Schorr-Waite algorithm -- from trees to graphs
- A machine-checked framework for relational separation logic
- Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
- Reasoning about memory layouts
This page was built for publication: Verification of the Schorr-Waite algorithm -- from trees to graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003486)