Various sorting algorithms formalised using the "sauto" component of CoqHammer 1.3.
-
Updated
Sep 24, 2021 - Coq
Various sorting algorithms formalised using the "sauto" component of CoqHammer 1.3.
Formalisation of the linear lambda calculus in Coq
A small coq library for verifying OCaml native integer computations
Formal proof that closure conversion with flat environments is safe for space.
Mechanized Proof for Article: "Revamping Hardware Persistency Models: View-Based and Axiomatic Persistency Models for Intel-x86 and Armv8" (PLDI 2021)
My works of mathematical proof using functional languages
Coq proof of an equivalence relation that is not congruent on the Imp language from Software Foundations
[WORK IN PROGRESS] Mechanized Proof for Article: "Memento: A Framework for Detectable Recoverability in Persistent Memory" (PLDI 2023)
He Reiter, Ho Reiter, He Reiter, Immer weiter!
A verified system transformer for serialization of Verdi systems using the Cheerios library.
Proofs of correctness for "Partial Aborts for Software Transactional Memory" formalized in Coq
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."