Study notes of Software Foundations
-
Updated
Aug 29, 2021 - Coq
Study notes of Software Foundations
Formally Verified Samplers From Probabilistic Programs With Loops and Conditioning
Exercises and project for Programming Language Seminar course at ITU
Źródła mojej książki o Coqu, programowaniu funkcyjnym, teorii typów, logice konstruktywnej i innych takich.
Extension of atomic triples in Iris with atomic postconditions and formal verification of the Lazy JellyFish skip list
An implementation of the logic for verifying the correctness of cloud storage system in Coq
Binary tree subterms form a lattice and related experiments in Coq
Formally verified 63-bit integer arithmetic, implemented in C and proven in Coq
Formal Verification of the Correctness of a Bubble Sort Implementation Using Coq
Work in progress. Attempt to prove semantic preservation (forward simulation) for a simple compiler.
A Correct-by-Construction Blockchain Protocol Implementation
Code and examples based on the book 'Certified Programming with Dependent Types' (version: June 30, 2016) by Adam Chlipala.
<Logical Foundations> personal study record.
Mechanised Reasoning about Array-Based Trees in Separation Logic
Code and examples based on the tutorial 'A Tutorial on [Co-]Inductive Types in Coq' by Eduardo Giménez and Pierre Castéran
What is a minimal wallet of coins that can express all amounts below a target?
This respository contains the formalization of different variations of divide-and-conquer algorithm design paradigm for lists. As a case study, we will see how these different variations lead to different sorting algorithms.
A small coq library for verifying OCaml native integer computations
Coq formalization of the Habanero programming model.
Add a description, image, and links to the formal-verification topic page so that developers can more easily learn about it.
To associate your repository with the formal-verification topic, visit your repo's landing page and select "manage topics."