tyler-utah / PBLLinks
A simple Python Boolean library that can parse and manipulate dimacs as well as a custom language. Try some of the features out online here: http://formal.cs.utah.edu:8080/pbl/PBL.php
☆10Updated 10 years ago
Alternatives and similar repositories for PBL
Users that are interested in PBL are comparing it to the libraries listed below
Sorting:
- ☆40Updated 6 years ago
- SMTInterpol interpolating SMT solver☆68Updated last month
- A simple Python Binary Decision Diagram (BDD) that outputs .dot files. It can also create minimal BDDs. Should be used mostly for educati…☆14Updated 11 years ago
- A multi-formalism, multi-solution model-checker centered on the language GAL☆25Updated this week
- The LTSmin model checking toolset☆60Updated 10 months ago
- Synthesis Format Conversion Tool☆26Updated last week
- Benchmark problems for different models of automata, transducers, and related logics☆30Updated 11 months ago
- Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability☆67Updated last year
- Specify and synthesize systems using symbolic algorithms☆50Updated 10 months ago
- ☆30Updated last month
- SRI Sally: A model checker for infinite-state systems.☆73Updated last month
- There is a new version of dReal, available at https://github.com/dreal/dreal4☆50Updated 4 years ago
- PC-miner tool for program chairs☆28Updated last week
- DepQBF, a solver for quantified boolean formulae (QBF).☆36Updated 2 years ago
- A Modern Probabilistic Model Checker☆152Updated this week
- Generates loop invariants for program verification☆62Updated 4 years ago
- SAT Solver SATCH☆119Updated 2 years ago
- Pedagogical first-order prover in Python☆76Updated 3 months ago
- The DRAT-trim proof checker☆64Updated 9 months ago
- Homebrew formulae for formal methods☆37Updated last month
- The Standard Interface for Incremental Satisfiability Solving☆50Updated 3 years ago
- Kodkod solver for relational logic☆78Updated 2 years ago
- Simple recursive and iterative SAT solver written in Python.☆123Updated 6 years ago
- VATA Tree Automata Library☆32Updated last year
- A set of basic tools for manipulating SyGuS benchmarks☆23Updated 2 years ago
- The probSAT SAT Solver☆23Updated 2 years ago
- Appendix of "Principles of Abstract Interpretation", P. Cousot, MIT Press, 2021, containing the proofs and the solutions of exercises not…☆43Updated 4 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆154Updated last month
- Lecture material for DeepSpec Summer School 2018☆68Updated 6 years ago
- Lecture notes for a short course on proving/programming in Coq via SSReflect.☆173Updated 4 years ago