nyu-acsys / drift
An abstract-interpretation-based static analysis for inferring refinement types
☆16Updated last month
Alternatives and similar repositories for drift
Users that are interested in drift are comparing it to the libraries listed below
Sorting:
- Relation algebra library for Coq☆48Updated last month
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 9 months ago
- a version of the 2048 game for Coq☆22Updated last year
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 2 weeks ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 3 months ago
- A generic goal preprocessing tool for proof automation tactics in Coq☆16Updated 5 months ago
- A verified Implementation of a mini prolog☆15Updated 2 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- BibTeX bibliographies for proof engineering-related papers☆30Updated 5 years ago
- ☆55Updated last month
- ☆13Updated last month
- ☆12Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A modular parametricity plugin for proof transfer in Coq [maintainers=@CohenCyril,@ecranceMERCE,@amahboubi]☆20Updated 2 weeks ago
- ☆13Updated 5 years ago
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆13Updated 9 months ago
- A program logic for concurrent randomized programs☆12Updated 6 years ago
- A bottom-up approach to a verified implementation of MLTT☆18Updated 2 months ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆15Updated 5 years ago
- EGraphs in OCaml☆65Updated last year
- A fornalisation of Grobner basis in ssreflect☆12Updated 4 months ago
- Library for Classical Coq☆39Updated 3 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated 2 weeks ago
- Finite sets and maps for Coq with extensional equality☆30Updated 5 months ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆24Updated 3 months ago
- An itree-like data-structure to additionally support internal non-determinism☆17Updated last month
- Formalising session types in Coq☆17Updated 5 years ago