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:
- A formally verified bug finder☆13Updated 10 months ago
- Stratified synthesis for learning machine code instruction semantics☆37Updated 3 weeks ago
- Genetic program repair using GHC☆30Updated last year
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- Staged Abstract Interpreters☆68Updated 2 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆17Updated last year
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- ☆39Updated this week
- Gallina to Bedrock2 compilation toolkit☆61Updated last week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- A graduate seminar on SMT solving and solver-aided systems☆27Updated 3 years ago
- Formalization of C++ for verification purposes.☆84Updated 2 weeks ago
- Mechanization of a noninterference proof for a toy imperative language with small-step semantics in Coq☆20Updated 5 years ago
- Incremental Program Analysis Framework☆93Updated 4 years ago
- GoNative project: formal machines models in Coq☆36Updated 8 years ago
- An automated deductive program verifier.☆42Updated 2 years ago
- Python library for program synthesis and symbolic execution combining constraint solving and LLMs☆28Updated last week
- Convert Haskell source code to Coq source code.☆88Updated 3 months ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- ☆53Updated last week
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 8 years ago
- ☆15Updated 4 years ago
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆13Updated last year
- Partition refinement☆16Updated 2 years ago
- Symbolic formula representation and solver interaction library☆169Updated this week
- Isabelle LLVM Code Generator and Refinement☆28Updated 3 months ago
- A formally verified implementation of differential dynamic logic in Coq☆18Updated 3 years ago
- LLVM support for the lean theorem prover☆52Updated 4 years ago
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- The SAW core language.☆54Updated 4 years ago