mpelleau / AbSoluteLinks
Constraint solver based on abstract domains
☆32Updated 8 months ago
Alternatives and similar repositories for AbSolute
Users that are interested in AbSolute are comparing it to the libraries listed below
Sorting:
- A modular sat/smt solver with proof output.☆99Updated last year
- Kleene algebra modulo theories☆27Updated 2 years ago
- Choice operator in OCaml, providing a backtracking monad☆26Updated 3 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆65Updated last month
- ☆55Updated 2 months ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- An overlay for the OCaml Z3 binding.☆34Updated 2 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Updated last year
- A not-quite-so-simple Binary Decision Diagrams implementation for OCaml☆37Updated 3 years ago
- ☆16Updated 6 years ago
- QUICr parametric abstract domain for sets☆12Updated 9 years ago
- OCaml hash-consing library☆51Updated last year
- EGraphs in OCaml☆65Updated last year
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- Efficient binder representation in OCaml☆42Updated 11 months ago
- HardCaml implementation of the OCaml ZINC Abstract Machine☆44Updated 5 years ago
- A generic goal preprocessing tool for proof automation tactics in Coq☆16Updated 6 months ago
- A Deductive Verification Tool for OCaml Programs☆73Updated last month
- OCaml syntax extension for synchronous programming...☆32Updated last year
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆44Updated 2 months ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last month
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Dolmen provides a library and a binary to parse, typecheck, and evaluate languages used in automated deduction☆87Updated last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- Coq library on rewriting theory and termination☆36Updated 2 weeks ago
- ☆29Updated 9 years ago