Dijkstra Shortest Path
From MaRDI portal
Cited in
(33)- A graph library for Isabelle
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Efficient verification of imperative programs using auto2
- Refinement to Imperative/HOL
- Formalizing the Edmonds-Karp algorithm
- Netsoft
- AEtnaNova
- Referee
- CFML
- MLton
- Fiat
- CAVA Automata Library
- Edmonds-Karp
- Flow Networks
- Graph Theory
- NASA PVS
- Refinement Monadic
- Separation Logic
- Gabow SCC
- Girth-Chromatic
- LTL_to_GBA
- Real_Impl
- Maximum Cardinality Matching
- Tree Automata
- Auto2_Imperative_HOL
- AutoCorres
- ShortestPath
- Automatic refinement to efficient data structures: a comparison of two approaches
- Prpu_Maxflow
- scientific article; zbMATH DE number 7649972 (Why is no real title available?)
- A framework for the verification of certifying computations
- Refinement to imperative HOL
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
This page was built for software: Dijkstra Shortest Path
