Proofs of correctness for "Partial Aborts for Software Transactional Memory" formalized in Coq
-
Updated
May 26, 2016 - Coq
Proofs of correctness for "Partial Aborts for Software Transactional Memory" formalized in Coq
A verified system transformer for serialization of Verdi systems using the Cheerios library.
An implementation of a simple asynchronous message-passing lock server, verified in Coq using the Verdi framework
Formalisation of the linear lambda calculus in Coq
Formal proof that closure conversion with flat environments is safe for space.
Correctness proofs of Ethereum token contracts
My works of mathematical proof using functional languages
Coq formalizations of functional languages.
Mechanized Proof for Article: "Revamping Hardware Persistency Models: View-Based and Axiomatic Persistency Models for Intel-x86 and Armv8" (PLDI 2021)
Various sorting algorithms formalised using the "sauto" component of CoqHammer 1.3.
Coq proof of an equivalence relation that is not congruent on the Imp language from Software Foundations
Add a description, image, and links to the proof topic page so that developers can more easily learn about it.
To associate your repository with the proof topic, visit your repo's landing page and select "manage topics."