katamaran-project / katamaran
Katamaran is a semi-automated separation logic verifier for the Sail specification language. It works on an embedded version of Sail called μSail and verifies separation logic-based contracts of functions by generating (succinct) first-order verification conditions.
☆17Updated 3 weeks ago
Related projects ⓘ
Alternatives and complementary repositories for katamaran
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆34Updated last year
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆32Updated 2 months ago
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 3 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆24Updated 10 months ago
- Library for Classical Coq☆38Updated 3 weeks ago
- Coq Enhancement Proposals☆49Updated 2 weeks ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated last month
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆29Updated 2 weeks ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆29Updated 3 months ago
- Coq library for tactics, basic definitions, sets, maps☆42Updated last week
- Gallina to Bedrock2 compilation toolkit☆50Updated last month
- Matita (proof assistant) with embedded elpi☆11Updated 6 years ago
- Binary analysis in HOL☆34Updated this week
- Formalising session types in Coq☆17Updated 5 years ago
- ☆35Updated 3 weeks ago
- ☆51Updated last month
- Relation algebra library for Coq☆48Updated last week
- Tiny verified SAT-solver☆28Updated 2 years ago
- A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.☆17Updated 2 weeks ago
- Formal Semantics for Why3☆14Updated this week
- Finite sets and maps for Coq with extensional equality☆29Updated last year
- Coq library on rewriting theory and termination☆35Updated 2 weeks ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆19Updated 7 months ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆14Updated last year
- Tons of Inductive Problems: The Benchmarks☆24Updated last year
- A proof of Abel-Ruffini theorem.☆28Updated this week
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated 10 months ago
- Probabilistic separation logics for verifying higher-order probabilistic programs.☆17Updated this week
- Bedrock Bit Vector Library☆27Updated 8 months ago