UCSD-PL / veridroneLinks
Foundational Verification of Hybrid Systems
☆15Updated 8 years ago
Alternatives and similar repositories for veridrone
Users that are interested in veridrone are comparing it to the libraries listed below
Sorting:
- ☆13Updated 5 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 6 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- Tactic for polynomial manipulations☆10Updated 2 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 11 months ago
- Formalising session types in Coq☆17Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Implementation of sprintf for Coq☆18Updated 5 years ago
- IO for Gallina☆33Updated 3 weeks ago
- A fornalisation of Grobner basis in ssreflect☆12Updated last week
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 3 years ago
- Reflection library for Coq☆12Updated 5 years ago
- Lenses in Coq☆19Updated 2 years ago
- A framework for extensible, reflective decision procedures.☆19Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- An OCaml EDSL for describing and solving strategic games☆17Updated last year
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 8 months ago
- Partial Commutative Monoids☆28Updated last month
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated last month
- ☆22Updated 9 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- A framework for implementing and certifying impure computations in Coq☆52Updated last year
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆25Updated 2 weeks ago
- Formal Semantics for Why3☆18Updated last week
- Robots powered by Constructive Reals☆34Updated 7 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 7 months ago