aeflores / CoFloCoLinks
CoFloCo is a static analysis tool written in prolog to infer automatically symbolic complexity bounds of imperative and recursive programs.
☆17Updated 3 years ago
Alternatives and similar repositories for CoFloCo
Users that are interested in CoFloCo are comparing it to the libraries listed below
Sorting:
- ☆36Updated this week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated this week
- Stratified synthesis for learning machine code instruction semantics☆37Updated 3 weeks ago
- Genetic program repair using GHC☆30Updated last year
- ☆15Updated 4 years ago
- Yet another haskell term rewriting library☆18Updated last year
- Relation algebra library for Coq☆48Updated 3 months ago
- Gallina to Bedrock2 compilation toolkit☆56Updated this week
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Solver for Constrained Horn Clauses☆39Updated 2 weeks ago
- Formalization of C++ for verification purposes.☆81Updated last week
- Staged Abstract Interpreters☆66Updated 2 years ago
- GoNative project: formal machines models in Coq☆36Updated 7 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆58Updated last year
- Coq library for tactics, basic definitions, sets, maps☆49Updated last week
- ☆51Updated 4 months ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- A translation verifier for Reopt (https://github.com/GaloisInc/reopt)☆16Updated 3 years ago
- Verification-condition-generation-based verifier for the Viper intermediate verification language.☆30Updated this week
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated 2 years ago
- Coq library for verified low-level programming☆60Updated 8 years ago
- Library for Classical Coq☆39Updated last month
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Some scripts to help construct small reproducing examples of bugs, implement [Proof using], etc.☆42Updated this week
- Communication between Coq and SAT/SMT solvers☆160Updated 9 months ago
- A template set for writing semantics in LaTeX☆12Updated 9 years ago
- Parser for the llvm bitcode format☆59Updated last week
- ☆21Updated 4 years ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆18Updated 5 years ago
- ☆55Updated 2 months ago