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:
- Genetic program repair using GHC☆30Updated last year
- Stratified synthesis for learning machine code instruction semantics☆37Updated last month
- Formalization of C++ for verification purposes.☆84Updated last week
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆61Updated 2 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- GoNative project: formal machines models in Coq☆36Updated 7 years ago
- An automated deductive program verifier.☆42Updated 2 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- ☆37Updated this week
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆19Updated 5 years ago
- A translation verifier for Reopt (https://github.com/GaloisInc/reopt)☆16Updated 3 years ago
- Gallina to Bedrock2 compilation toolkit☆58Updated this week
- Staged Abstract Interpreters☆66Updated 2 years ago
- Inline, type safe X86-64 assembly programming in Agda☆70Updated 6 years ago
- Symbolic execution engine for toy language.☆51Updated 7 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 weeks ago
- Haskell bindings to Microsoft's Z3 API (unofficial).☆59Updated last year
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- ☆15Updated 4 years ago
- CS410 "Advanced Functional Programming"☆25Updated 2 months ago
- ☆53Updated 4 months ago
- An automated theorem prover for intuitionistic propostional logic☆12Updated 4 years ago
- Abstracting Definitional Interpreters☆68Updated 7 years ago
- A toy symbolic execution engine, supporting the blog article ...☆17Updated 3 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated last month
- Library for Classical Coq☆39Updated last month
- LLVM support for the lean theorem prover☆48Updated 3 years ago
- Partition refinement☆15Updated last year
- A graduate seminar on SMT solving and solver-aided systems☆26Updated 3 years ago