evdenis / acsl-proved
Fully proved small C functions (examples for verification course).
☆16Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for acsl-proved
- Intermediate Memory Model (IMM) and compilation correctness proofs for it☆21Updated 3 months ago
- a version of the 2048 game for Coq☆22Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- Formalization of termination of Gödel's System T☆9Updated 3 years ago
- Bedrock Bit Vector Library☆27Updated 8 months ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- ☆51Updated this week
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆12Updated last year
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 5 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆29Updated 3 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 7 months ago
- Experimentation project☆16Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- ☆22Updated 8 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 5 years ago
- A benchmark for C program verification☆15Updated 9 months ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆21Updated 7 years ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆18Updated 4 years ago
- A formalization of properties of a simple imperative, memory-safe language.☆19Updated 3 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 7 years ago
- ☆18Updated 2 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Deadlock freedom by type checking☆19Updated last year
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 11 years ago
- Binary logical relations library for the Coq proof assistant☆20Updated 3 weeks ago