aeflores / CoFloCoLinks
CoFloCo is a static analysis tool written in prolog to infer automatically symbolic complexity bounds of imperative and recursive programs.
☆19Updated 4 years ago
Alternatives and similar repositories for CoFloCo
Users that are interested in CoFloCo are comparing it to the libraries listed below
Sorting:
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A formally verified implementation of differential dynamic logic in Coq☆18Updated 3 years ago
- A formally verified bug finder☆13Updated 11 months ago
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- Genetic program repair using GHC☆31Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- Stratified synthesis for learning machine code instruction semantics☆37Updated last month
- An automated deductive program verifier.☆42Updated 2 years ago
- Gallina to Bedrock2 compilation toolkit☆64Updated this week
- Relation algebra library for Coq☆48Updated last month
- ☆40Updated this week
- Staged Abstract Interpreters☆68Updated 2 years ago
- Formalization of C++ for verification purposes.☆85Updated this week
- miniKanren with a first-order representation of the search space☆17Updated last year
- ☆56Updated 3 weeks ago
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- The SAW core language.☆54Updated 4 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A toy symbolic execution engine, supporting the blog article ...☆18Updated 4 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 9 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- ☆23Updated 11 months ago
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2018☆23Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- Constructive Galois connections☆35Updated 7 years ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆20Updated 5 years ago
- GoNative project: formal machines models in Coq☆36Updated 8 years ago
- A verified Implementation of a mini prolog☆17Updated 2 years ago