FreeSpec
impure computation framework
A framework for specifying and verifying impure computations in a formal proof assistant
A framework for implementing and certifying impure computations in Coq
52 stars
9 watching
11 forks
Language: Coq
last commit: about 1 year ago
Linked from 2 awesome lists
coqformal-verificationfreer-monads
Related projects:
Repository | Description | Stars |
---|---|---|
| A library for representing recursive and impure programs in the Coq proof assistant language. | 206 |
| Provides a data structure and framework for monotonically-growing concurrent programs | 80 |
| A personal repository of formally verified mathematics using the Coq proof assistant | 292 |
| A verification system for reasoning about sequential heap-manipulating programs using separation logic and dependent types | 70 |
| A foundational framework for modular cryptographic proofs in Coq | 56 |
| Compilation correctness proofs for an intermediate memory model | 21 |
| A framework for machine-checked proofs of cryptography in the computational model. | 48 |
| A Coq library demonstrating design patterns for automated proof automation and canonical structures | 26 |
| A formalisation of Partial Commutative Monoids (PCMs) for verification of concurrent programs. | 26 |
| A compiler for a constant-time programming language used in cryptography | 198 |
| Compiles high-level programming languages into input for provable computations protocols. | 304 |
| A collection of formalized and provable data structures and algorithms in Coq for educational purposes | 46 |
| Creating a programming language and ecosystem to make formal verification and provably correct software development practical and mainstream for working software engineers. | 810 |
| A Coq library providing tactics to manipulate hypotheses in formal proofs. | 20 |
| A formalization of polymorphic lambda calculus with a proof of parametricity theorem. | 33 |