TACACS protocol implemented in OCaml and Coq prover
-
Updated
Jul 1, 2025 - Rocq Prover
Coq is a formal proof management system. It provides a formal language to write
mathematical definitions, executable algorithms and theorems together with an
environment for semi-interactive development of machine-checked proofs. Typical
applications include the certification of properties of programming languages,
the formalization of mathematics and teaching.
TACACS protocol implemented in OCaml and Coq prover
Project in Programming Language Seminar. Implement and prove properties about finger trees.
Demo of using Iris to prove a simple property of a concurrent program
Certified implementation in Coq of Stålmarck's algorithm for proving tautologies [maintainer=@palmskog]
Coq development of almost-full relations, including the Ramsey Theorem, useful for proving termination [maintainer=@palmskog]
PolyGen is a code generator for the polyhedral model, written and proved in Coq.
A Coq tactic for proving multivariate inequalities using SDP solvers
Attempt to prove semantic preservation (forward simulation) for a simple compiler.
Proving crash safety for systems with layered recovery
Coqtail is a library of mathematical theorems and tools proved inside the Coq proof assistant. Results range mostly from arithmetic to real and complex analysis. [maintainer=@jmadiot]
Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]
A Learning Environment for Theorem Proving
Lecture notes for a short course on proving/programming in Coq via SSReflect.
Created by Gérard Pierre Huet, Thierry Coquand
Released 1989