Alternatives and similar repositories for obst

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

• lonsing / depqbf
  DepQBF, a solver for quantified boolean formulae (QBF).
  ☆39Updated 2 years ago
• eprover / PyRes
  Pedagogical first-order prover in Python
  ☆79Updated 7 months ago
• meelgroup / ganak
  High-performance model counter
  ☆52Updated last week
• utwente-fmt / ltsmin
  The LTSmin model checking toolset
  ☆60Updated last year
• biotomas / ipasir
  The Standard Interface for Incremental Satisfiability Solving
  ☆51Updated 3 years ago
• UCSD-PL / proverbot9001
  ☆44Updated last week
• moves-rwth / storm
  A Modern Probabilistic Model Checker
  ☆158Updated 3 weeks ago
• ai4reason / Prover9
  Prover9 is an automated theorem prover for first-order and equational logic, and Mace4 searches for finite models and counterexamples.
  ☆58Updated 2 years ago
• meyerphi / strix
  Strix is a tool for reactive synthesis of controllers from LTL specifications.
  ☆24Updated 3 years ago
• lorisdanto / automatark
  Benchmark problems for different models of automata, transducers, and related logics
  ☆30Updated 3 months ago
• probing-lab / polar
  ☆17Updated 9 months ago
• ReedOei / Pecan
  An automated theorem prover that uses Büchi automata.
  ☆44Updated 4 years ago
• TyGuS / suslik
  Synthesis of Heap-Manipulating Programs from Separation Logic
  ☆128Updated 2 years ago
• eprover / eprover
  ☆162Updated this week
• SyGuS-Org / benchmarks
  Benchmarks for SyGuS Competition (SyGuS-Comp)
  ☆42Updated 2 years ago
• sdiehl / pyrewrite
  Python term rewriting
  ☆30Updated 12 years ago
• piantado / enumerateCFG
  Code for enumeration from a CFG
  ☆20Updated 2 years ago
• marijnheule / drat-trim
  The DRAT-trim proof checker
  ☆68Updated last year
• rishabhs / sygus-comp14
  ☆40Updated 6 years ago
• owl-toolkit / owl
  ☆20Updated 2 years ago
• fslivovsky / qute
  Qute: a dependency learning QBF solver.
  ☆14Updated last month
• arminbiere / satch
  SAT Solver SATCH
  ☆120Updated 3 years ago
• cs-au-dk / MONA
  MONA - a decision procedure for monadic second-order logic on finite strings and trees
  ☆55Updated 5 years ago
• jfeser / L2
  λ² is a tool for synthesizing functional programs from input-output examples.
  ☆87Updated 2 years ago
• reactive-systems / bosy
  BoSy is a reactive synthesis tool based on constraint-solving
  ☆19Updated 2 years ago
• cognitive-engineering-lab / document-calculus
  Accompanying materials for "A Core Calculus for Documents"
  ☆36Updated 2 years ago
• leoprover / Leo-III
  An Automated Theorem Prover for Classical Higher-Order Logic with Henkin Semantics
  ☆50Updated 3 months ago
• dcao / babble
  library learning w egraphs
  ☆24Updated 2 years ago
• rocq-community / coq-100-theorems
  Statements of famous theorems proven in Coq [maintainer=@jmadiot]
  ☆61Updated 2 months ago
• ultimate-pa / smtinterpol
  SMTInterpol interpolating SMT solver
  ☆69Updated this week