Alternatives and similar repositories for obst

Users that are interested in obst are comparing it to the libraries listed below

• leoprover / Leo-III
  An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics
  ☆47Updated last month
• utwente-fmt / ltsmin
  The LTSmin model checking toolset
  ☆60Updated 7 months ago
• lonsing / depqbf
  DepQBF, a solver for quantified boolean formulae (QBF).
  ☆34Updated 2 years ago
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆49Updated 2 years ago
• avigad / polya
  A heuristic procedure for proving inequalities
  ☆33Updated 6 years ago
• meyerphi / strix
  Strix is a tool for reactive synthesis of controllers from LTL specifications.
  ☆22Updated 2 years ago
• eprover / PyRes
  Pedagogical first-order prover in Python
  ☆75Updated this week
• moves-rwth / caesar
  Deductive verification infrastructure for probabilistic programs
  ☆18Updated last week
• opencompl / lean-mlir-old
  embedding MLIR in LEAN
  ☆47Updated 11 months ago
• meelgroup / ganak
  High-performance probabilistic exact counter
  ☆41Updated this week
• ReedOei / Pecan
  An automated theorem prover that uses Büchi automata.
  ☆41Updated 3 years ago
• alexander-nadel / intel_sat_solver
  This repository contains the code of Intel(R) SAT Solver (IntelSAT)
  ☆29Updated 2 months ago
• tulip-control / omega
  Specify and synthesize systems using symbolic algorithms
  ☆49Updated 7 months ago
• owl-toolkit / owl
  ☆18Updated last year
• leanprover-community / con-nf
  A formal consistency proof of Quine's set theory New Foundations
  ☆71Updated last week
• reactive-systems / bosy
  BoSy is a reactive synthesis tool based on constraint-solving
  ☆19Updated last year
• adl / hoaf
  Hanoi Omega-Automata Format
  ☆15Updated 2 years ago
• leanprover / leansat
  This package provides an interface and foundation for verified SAT reasoning
  ☆52Updated 9 months ago
• mit-plv / bedrock
  Coq library for verified low-level programming
  ☆59Updated 7 years ago
• bzhan / holpy
  Implementation of higher-order logic in Python
  ☆65Updated 2 years ago
• medovina / natty
  Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…
  ☆34Updated this week
• uds-psl / coq-library-complexity
  ☆31Updated last year
• agrarpan / coq-synthesis
  coq-synthesis is a Coq plugin for proof generation and next tactic prediction
  ☆13Updated 10 months ago
• coq-tactician / coq-tactician
  A Seamless, Interactive Tactic Learner and Prover for Coq
  ☆68Updated last month
• leuschel / logen
  Offline partial evaluation system for Prolog written using the cogen approach
  ☆19Updated 8 years ago
• jrclogic / SMCDEL
  A symbolic model checker for Dynamic Epistemic Logic.
  ☆46Updated 3 months ago
• tlringer / proof-demos
  Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic
  ☆38Updated 2 years ago
• ai4reason / Prover9
  Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.
  ☆53Updated last year
• ultimate-pa / smtinterpol
  SMTInterpol interpolating SMT solver
  ☆66Updated 3 weeks ago
• rocq-community / coq-100-theorems
  Statements of famous theorems proven in Coq [maintainer=@jmadiot]
  ☆60Updated last year