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