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☆40Updated 4 months ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- A language-generic implementation of equality saturation in Haskell☆22Updated 7 years ago
- Genetic program repair using GHC☆33Updated last year
- A formally verified bug finder☆14Updated last year
- Formalization of Typed Assembly Language (TAL) in Coq☆18Updated last year
- GoNative project: formal machines models in Coq☆36Updated 8 years ago
- Formalization of C++ for verification purposes.☆90Updated this week
- A formally verified implementation of differential dynamic logic in Coq☆18Updated 3 years ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆20Updated 5 years ago
- An automated theorem prover for intuitionistic propostional logic☆14Updated 5 years ago
- A tool for translating imperative programs to CSP.☆13Updated 9 years ago
- A translation verifier for Reopt (https://github.com/GaloisInc/reopt)☆20Updated 4 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated last week
- An automated deductive program verifier.☆43Updated 2 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- The SAW core language.☆55Updated 4 years ago
- A toy symbolic execution engine, supporting the blog article ...☆18Updated 4 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- A graduate seminar on SMT solving and solver-aided systems☆28Updated 3 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 5 months ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 10 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- ☆42Updated this week
- LLVM support for the lean theorem prover☆53Updated 4 years ago
- Staged Abstract Interpreters☆69Updated 2 years ago
- Verified C programming in Agda☆16Updated 4 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- ☆54Updated 3 months ago
- An automated theorem prover that uses Büchi automata.☆44Updated 4 years ago