Formalisation of Separation Logic and Mutability
-
Updated
Feb 24, 2021 - Coq
Formalisation of Separation Logic and Mutability
Machine-checked proofs of secrecy and authentication using CCSA framework
Formal proof with the Coq theorem prover of the equivalence of three semantics for a language describing the behavior of distributed systems.
COQ. Certified Programming with Dependent Types by Adam Chlipala. Exercises from the book. Solutions.
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.
Demonstration, in Coq, that the Euclidean Algorithm can be efficiently used to compute the greatest common divisor of two numbers
Some personal notes on typical algebra topics
∇⎕ coloring
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
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."