Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra

Peter Lammich 🌐 and Tobias Nipkow 🌐

June 25, 2019

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

We verify purely functional, simple and efficient implementations of Prim's and Dijkstra's algorithms. This constitutes the first verification of an executable and even efficient version of Prim's algorithm. This entry formalizes the second part of our ITP-2019 proof pearl Purely Functional, Simple and Efficient Priority Search Trees and Applications to Prim and Dijkstra.

License

BSD License

Topics

Related publications

  • Lammich, P., & Nipkow, T. (2019). Proof Pearl: Purely Functional, Simple and Efficient Priority Search Trees and Applications to Prim and Dijkstra (Version 1.0). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITP.2019.23

Session Prim_Dijkstra_Simple

Depends on

Cite

× 
@article{Prim_Dijkstra_Simple-AFP,
  author  = {Peter Lammich and Tobias Nipkow},
  title   = {Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra},
  journal = {Archive of Formal Proofs},
  month   = {June},
  year    = {2019},
  note    = {\url{https://isa-afp.org/entries/Prim_Dijkstra_Simple.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: