Machine-checked proofs of secrecy and authentication using CCSA framework
-
Updated
Mar 30, 2020 - Coq
Machine-checked proofs of secrecy and authentication using CCSA framework
COQ. Certified Programming with Dependent Types by Adam Chlipala. Exercises from the book. Solutions.
A proof of factorization using Takahashi's method
Some personal notes on typical algebra topics
Formalisation of Separation Logic and Mutability
Deadlock avoidance on using futures in shared memory. The project includes the formalization of a trace language and results on a policy on safe joins (through a notion of known tasks) and we show that data-race-freedom implies deadlock freedom.
This is a repo of my master's thesis written as part of my studies at the University of Wrocław
Descriptions & implementations of type-reconstruction/inference algorithms.
Coq implementations and proof scripts developed for a course in mechanical reasoning.
Coq proof of the Euler product formula for the Riemann zeta function (in progress...)
Formalization of Lewis Carroll syllogism from Symbolic Logic and proof it with Coqlang.
A vector library specialized in the formalization of SPMD programs
Algebraic Combinatorics in Coq
A constructive account of Kripke-Curry's decidability proof for Implicational Relevance logic (see README.md below)
Computer Scientist Degree - Thesis Work
Add a description, image, and links to the coq-formalization topic page so that developers can more easily learn about it.
To associate your repository with the coq-formalization topic, visit your repo's landing page and select "manage topics."