Compiling Concurrency Correctly—Verifying Software Transactional Memory
-
Updated
Aug 21, 2017 - TeX
Compiling Concurrency Correctly—Verifying Software Transactional Memory
Exercises and project for Programming Language Seminar course at ITU
Paxos algorithm specified and proved in TLA+/PlusCal, with separate processes and invariants for proposers and acceptors.
some simple&naive formal proof of trivial Number Theory, using Agda/Coq, just to practice skills
Examples to get some practice on functional programming and formal proofs
An implementation of Algorithm W in Idris with a complete proof
Solutions to Coq exercises from Formal proof: an Introduction to Type Theory class in 2018/1
A formal proof of the irrationality of sqrt(2) written in lean
Formalization of temporal logic in Coq
Second Sylow Theorem in Lean (Fork of ChrisHughes24/Sylow)
Group Theory (Second Sylow Theorem) formalized in Naproche.
Coq course materials with my solutions
formally verified category theory library
Aris: a logic engine/formal proof interface; 2nd generation, successor to the C version of Aris.
A formal specification and verification of Tree Sort algorithm in Coq
Web-based natural deduction proof assistant
Add a description, image, and links to the formal-proofs topic page so that developers can more easily learn about it.
To associate your repository with the formal-proofs topic, visit your repo's landing page and select "manage topics."