Provably correct indexed binary search tree
-
Updated
Aug 2, 2022 - Agda
Provably correct indexed binary search tree
Euclidean algorithm, formally verified, provably correct
Prove spec for a program that increases a list and sums it in parallel (Final project, CS 472, Spring 2024 @ UIC).
Add a description, image, and links to the provably-correct topic page so that developers can more easily learn about it.
To associate your repository with the provably-correct topic, visit your repo's landing page and select "manage topics."