Using F* to prove non-interference for a well-typed subset of programs written in a small imperative language
-
Updated
Jul 7, 2018
Using F* to prove non-interference for a well-typed subset of programs written in a small imperative language
Slides and code snippets for a talk I have given in November 2021.
verimqtt, a formally verified mqtt library written in F*.一定の条件下であればバグがないMQTT実装。
Proving equivalence of spec for Poly1305 in HACL* and Vale
🧠️🖥️2️⃣️0️⃣️0️⃣️1️⃣️💾️📜️ The sourceCode:FStar category for AI2001, containing F* programming language datasets
The F* Programming language IDE submodule for SNU Programming Tools.
A repository for showcasing my knowledge of the F* programming language, and continuing to learn the language.
A formally verified implementation of a bolt-on security device for ICS networks. Designed with TLA+ and written/proved in F*
Working through the F* tutorial (https://www.fstar-lang.org/tutorial/)
Add a description, image, and links to the fstar topic page so that developers can more easily learn about it.
To associate your repository with the fstar topic, visit your repo's landing page and select "manage topics."