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

GitHub

52 stars
9 watching
11 forks
Language: Coq
last commit: over 2 years ago
Linked from 2 awesome lists

coqformal-verificationfreer-monads

Backlinks from these awesome lists:

Related projects:

RepositoryDescriptionStars
deepspec/interactiontreesA library for representing recursive and impure programs in the Coq proof assistant language.206
iu-parfunc/lvarsProvides a data structure and framework for monotonically-growing concurrent programs80
stepchowfun/proofsA personal repository of formally verified mathematics using the Coq proof assistant292
imdea-software/httA verification system for reasoning about sequential heap-manipulating programs using separation logic and dependent types70
ssprove/ssproveA foundational framework for modular cryptographic proofs in Coq56
weakmemory/immCompilation correctness proofs for an intermediate memory model21
adampetcher/fcfA framework for machine-checked proofs of cryptography in the computational model.48
coq-community/lemma-overloadingA Coq library demonstrating design patterns for automated proof automation and canonical structures26
imdea-software/fcsl-pcmA formalisation of Partial Commutative Monoids (PCMs) for verification of concurrent programs.26
plsyssec/factA compiler for a constant-time programming language used in cryptography198
nilfoundation/zkllvmCompiles high-level programming languages into input for provable computations protocols.304
foreverbell/verifiedA collection of formalized and provable data structures and algorithms in Coq for educational purposes46
magmide/magmideCreating a programming language and ecosystem to make formal verification and provably correct software development practical and mainstream for working software engineers.810
matafou/libhypsA Coq library providing tactics to manipulate hypotheses in formal proofs.20
lysxia/system-fA formalization of polymorphic lambda calculus with a proof of parametricity theorem.33