fadoss / maude-bindingsLinks
Language bindings for Maude
☆23Updated 6 months ago
Alternatives and similar repositories for maude-bindings
Users that are interested in maude-bindings are comparing it to the libraries listed below
Sorting:
- Unified Maude model-checking tool☆12Updated 6 months ago
- DepQBF, a solver for quantified boolean formulae (QBF).☆35Updated 2 years ago
- Formalization of Machine Learning Theory with Applications to Program Synthesis☆76Updated 2 months ago
- Repository of benchmarks for SYNTCOMP☆11Updated last month
- Pedagogical first-order prover in Python☆76Updated last month
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 5 months ago
- KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)☆82Updated 2 weeks ago
- Python library for program synthesis and symbolic execution combining constraint solving and LLMs☆21Updated 2 weeks ago
- ☆15Updated 4 years ago
- Verimag Polyhedra Library☆18Updated 3 months ago
- SPARK 2014 repository for the Why3 verification platform.☆32Updated 3 weeks ago
- A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.☆18Updated last week
- Supplement of the ICFP'22 paper "‘do’ Unchained: Embracing Local Imperativity in a Purely Functional Language"☆13Updated 5 months ago
- An implementation of Hoare and He's Unifying Theories of Programming in Isabelle☆36Updated last year
- Language based on Rewriting Logic☆127Updated this week
- CoqTL allows users to write model transformations and prove engine/transformation correctness in Coq☆14Updated 3 years ago
- Tons of Inductive Problems: The Benchmarks☆26Updated 2 years ago
- Verification-condition-generation-based verifier for the Viper intermediate verification language.☆31Updated last week
- A heuristic procedure for proving inequalities☆33Updated 6 years ago
- ☆16Updated 2 years ago
- Fuzz testing for Dafny☆13Updated 3 years ago
- The Termination Problem Database☆31Updated last month
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆64Updated last year
- A model checker for relational first-order temporal specifications☆27Updated 4 years ago
- an optimizing curry compiler☆14Updated 2 years ago
- Tutorial for the CHR system☆16Updated 4 years ago
- A Lean library for Computer Science☆23Updated this week
- MONA - a decision procedure for monadic second-order logic on finite strings and trees☆51Updated 5 years ago
- Implementation of higher-order logic in Python☆65Updated 2 years ago
- Tool for suggesting lemma names in Coq verification projects☆20Updated 2 years ago