evdenis / acsl-proved
Fully proved small C functions (examples for verification course).
☆16Updated 7 years ago
Alternatives and similar repositories for acsl-proved:
Users that are interested in acsl-proved are comparing it to the libraries listed below
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- A benchmark for C program verification☆16Updated last year
- ☆55Updated 3 weeks ago
- Formalization of termination of Gödel's System T☆9Updated 3 years ago
- Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on☆21Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆42Updated 2 months ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆12Updated 2 years ago
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2020☆19Updated 4 years ago
- Bedrock Bit Vector Library☆27Updated last year
- A formalization of properties of a simple imperative, memory-safe language.☆19Updated 3 years ago
- ☆22Updated 9 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Provides a reference implementation of FeatherweightRust in Java.☆14Updated 3 years ago
- Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components …☆15Updated last month
- Lenses in Coq☆18Updated 2 years ago
- Dafny for Metatheory of Programming Languages☆25Updated 3 months ago
- A Gallina compiler with C++17 as an intermediate representation☆43Updated 4 years ago
- ☆42Updated 6 years ago
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- miniKanren with a first-order representation of the search space☆16Updated 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.☆22Updated 8 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- Formalization of the Truly Stateless Concurrency Model Checker in Coq☆13Updated 3 years ago