https://github.com/foreverbell/verified

Coq formalizations and proofs of (data) structures and algorithms.
https://github.com/foreverbell/verified

coq formal-verification

Last synced: 4 months ago
JSON representation

Coq formalizations and proofs of (data) structures and algorithms.

• Host: GitHub
• URL: https://github.com/foreverbell/verified
• Owner: foreverbell
• Created: 2017-05-20T14:08:04.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2018-05-13T09:47:29.000Z (over 6 years ago)
• Last Synced: 2024-09-30T20:51:32.477Z (4 months ago)
• Topics: coq, formal-verification
• Language: Coq
• Homepage:
• Size: 135 KB
• Stars: 45
• Watchers: 4
• Forks: 3
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# verified

Gems of verified things for educational purpose.

All known to compile under Coq `8.7`.

## Items

* LTL: Linear temporal logic.

* binary-heap: Binary heap.

* binary-search-tree: Binary search tree.

* binary-trie: Binary trie.

* cps: Continuation passing style (CPS).

* fast-power: Fast power method generalized to monoids.

* finger-tree: Finger tree, specfied abstractly with a list.

* group-theory: Group theory.

* hoare: Hoare logic.

* monads: Monad.

* peterson: Peterson's locking algorithm.

* sorting-algorithms: Various sorting algorithms including insert / selection / quick sort.

* stlc-deptype: A STLC implementation with dependent type.

* two-stack-queue: Queue implemented by two stacks with amotized `O(1)` complexity.

* vect-deptype: Vector with dependent type.