A parser based on the ALL(*) algorithm, implemented and verified in Coq.
☆13Feb 14, 2023Updated 3 years ago
Alternatives and similar repositories for CoStar
Users that are interested in CoStar are comparing it to the libraries listed below
Sorting:
- Coq library for serialization to S-expressions☆20Jul 3, 2023Updated 2 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆21Mar 19, 2015Updated 11 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Oct 22, 2023Updated 2 years ago
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆15Jul 22, 2024Updated last year
- Foundational Verification of Hybrid Systems☆15Mar 23, 2017Updated 9 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- An implementation of "A Typed, Algebraic Approach to Parsing"☆11Mar 21, 2022Updated 4 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Mar 16, 2026Updated last week
- Coq library on rewriting theory and termination☆37Jan 27, 2026Updated last month
- Official repository of the Autosubst 2 project.☆25May 8, 2023Updated 2 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Mar 13, 2023Updated 3 years ago
- Template project for Coq plugins using the Dune build system, showcasing some advanced features [maintainer=@ejgallego]☆22Jul 13, 2023Updated 2 years ago
- Modular Finite Maps over Ordered Types in Coq [maintainers=@letouzey,@palmskog]☆11Jun 30, 2024Updated last year
- LL(1) parser generator verified in Coq☆48Jan 30, 2020Updated 6 years ago
- Coq plugin for monomorphization and C code generation☆40Jan 16, 2026Updated 2 months ago
- Fully proved small C functions (examples for verification course).☆17Jun 26, 2017Updated 8 years ago
- A program logic for concurrent randomized programs☆14Nov 9, 2018Updated 7 years ago
- Template project for program verification in the Rocq Prover, showcasing reasoning on CompCert's Clight language using the Verified Softw…☆35Mar 3, 2026Updated 2 weeks ago
- Micromega tactics for Mathematical Components☆28Mar 3, 2026Updated 2 weeks ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104May 16, 2025Updated 10 months ago
- An itree-like data-structure to additionally support internal non-determinism☆20Nov 25, 2025Updated 3 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Sep 15, 2021Updated 4 years ago
- Universal instruction selection☆12Jun 8, 2018Updated 7 years ago
- Partial Commutative Monoids☆35Updated this week
- A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.☆18Aug 21, 2025Updated 7 months ago
- The original parsing with derivatives haskell implementation☆12Aug 25, 2015Updated 10 years ago
- Alternative implementation of the logical framework Dedukti in Rust☆23Apr 10, 2025Updated 11 months ago
- Binary analysis in HOL☆46Mar 9, 2026Updated last week
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Nov 3, 2021Updated 4 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- ☆18May 1, 2020Updated 5 years ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆25Mar 3, 2026Updated 2 weeks ago
- ☆17Jun 10, 2022Updated 3 years ago
- A library of Coq definitions, theorems, and tactics. [maintainers=@gmalecha,@liyishuai]☆136Feb 26, 2026Updated 3 weeks ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆47Mar 3, 2026Updated 2 weeks ago
- Gallina to Bedrock2 compilation toolkit☆66Mar 5, 2026Updated 2 weeks ago
- Collection of Distributed Protocol Verification Problems☆15Apr 27, 2024Updated last year
- Tool for suggesting lemma names in Coq verification projects☆22Sep 6, 2022Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 5 years ago