Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra
From MaRDI portal
- A graph library for Isabelle
- A note on two problems in connexion with graphs
- A simple implementation technique for priority search queues
- Applying data refinement for monadic programs to Hopcroft's algorithm
- Characteristic formulae for the verification of imperative programs
- Code generation via higher-order rewrite systems
- Concrete semantics. With Isabelle/HOL
- Data refinement in Isabelle/HOL
- Finger trees: a simple general-purpose data structure
- Higher order logic theorem proving and its applications. 7th international workshop, Valletta, Malta, September 19--22, 1994. Proceedings
- HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Introduction to algorithms.
- Isabelle/HOL. A proof assistant for higher-order logic
- Priority Search Trees
- Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
- Program-ing finger trees in Coq
- Proof of correctness of data representations
- Relation-algebraic verification of Prim's minimum spanning tree algorithm
- Theoretical aspects of computing -- ICTAC 2016. 13th international colloquium, Taipei, Taiwan, ROC, October 24--31, 2016. Proceedings
- Why3 -- where programs meet provers
- ZB 2003: Formal specification and development in Z and B. Third international conference of B and Z users, Turku, Finland, June 4--6, 2003. Proceedings
This page was built for software: Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra
