Pages that link to "Item:Q2879261"
From MaRDI portal
The following pages link to Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm (Q2879261):
Displaying 16 items.
- Gabow SCC (Q40629) (← links)
- Formal verification of an executable LTL model checker with partial order reduction (Q682350) (← links)
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- I/O- and CPU-optimal recognition of strongly connected components (Q1209333) (← links)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
- Refinement to imperative HOL (Q1739909) (← links)
- From LCF to Isabelle/HOL (Q2280211) (← links)
- Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
- Formalizing the Edmonds-Karp Algorithm (Q2829260) (← links)
- Refinement to Imperative/HOL (Q2945637) (← links)
- (Q5875419) (← links)
- (Q5875421) (← links)
- (Q5875426) (← links)
- (Q5875428) (← links)
- Efficient verified (UN)SAT certificate checking (Q5919480) (← links)
- Refinement of parallel algorithms down to LLVM: applied to practically efficient parallel sorting (Q6611962) (← links)