package coq-tree-diameter

  1. Overview
  2. Homepage
Diameter of a binary tree

Install

Dune Dependency

github.com Edit opam file Versions (6)

Authors

  1. J
    Jean-Christophe Filliâtre

Maintainers

  1. H
    Hugo.Herbelin@inria.fr

Sources

v8.10.0.tar.gz
md5=82e071e80da869e73f1de3245bec8df6

Description

This contribution contains the verification of a divide-and-conquer algorithm to compute the diameter of a binary tree (the maxmimal distance between two nodes in the tree).

Tags

keyword: program verification keyword: trees keyword: paths keyword: graphs keyword: distance keyword: diameter category: Computer Science/Decision Procedures and Certified Algorithms/Correctness proofs of algorithms

Published: 07 Dec 2019

Dependencies (2)

  1. coq >= "8.10" & < "8.11~"
  2. ocaml

Dev Dependencies

None

Used by

None

Conflicts

None

Rocq

Interactive Theorem Prover

Zulip GitHub Discourse Mastodon RSS
About
Changelog Releases Industrial Users Academic Users History Why Rocq? Roadmap
Ecosystem
Platform Packages Rocq Team Community Consortium Events Rocq Planet Jobs
Resources
Install Rocq Get Started Documentation Books Papers Logo
Policies
Governance Privacy Code of Conduct