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:
- Stratified synthesis for learning machine code instruction semantics☆37Updated 3 weeks ago
- A formally verified bug finder☆13Updated 10 months ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- Genetic program repair using GHC☆30Updated last year
- A formally verified implementation of differential dynamic logic in Coq☆18Updated 3 years ago
- A translation verifier for Reopt (https://github.com/GaloisInc/reopt)☆17Updated 4 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- Formalization of C++ for verification purposes.☆84Updated this week
- Symbolic formula representation and solver interaction library☆168Updated 3 weeks ago
- ☆39Updated this week
- Staged Abstract Interpreters☆68Updated 2 years ago
- Gallina to Bedrock2 compilation toolkit☆60Updated last week
- The SAW core language.☆54Updated 4 years ago
- Convert Haskell source code to Coq source code.☆88Updated 3 months ago
- An automated deductive program verifier.☆42Updated 2 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- GoNative project: formal machines models in Coq☆36Updated 8 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆62Updated last year
- Haskell bindings for the Souffle datalog language☆105Updated last year
- ☆15Updated 4 years ago
- A toy symbolic execution engine, supporting the blog article ...☆18Updated 4 years ago
- LLVM support for the lean theorem prover☆51Updated 4 years ago
- A synthesis-enabled solver for relational logic☆28Updated 7 years ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆20Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- Synthesis of Heap-Manipulating Programs from Separation Logic☆128Updated 2 years ago
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- ☆16Updated last year
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago