tyler-utah / PBDDLinks
A simple Python Binary Decision Diagram (BDD) that outputs .dot files. It can also create minimal BDDs. Should be used mostly for educational purposes as it is not very efficient. Try it out online here: http://formal.cs.utah.edu:8080/pbl/BDD.php
☆14Updated 11 years ago
Alternatives and similar repositories for PBDD
Users that are interested in PBDD are comparing it to the libraries listed below
Sorting:
- There is a new version of dReal, available at https://github.com/dreal/dreal4☆50Updated 4 years ago
- FPsolve: solver for polynomial equations over omega-continuous semirings☆11Updated 10 years ago
- Lattice-based integer linear programming solver☆65Updated 2 months ago
- MONA - a decision procedure for monadic second-order logic on finite strings and trees☆53Updated 5 years ago
- KeYmaera X: An aXiomatic Tactical Theorem Prover for Hybrid Systems (release)☆84Updated 3 months ago
- The Termination Problem Database☆29Updated last month
- DepQBF, a solver for quantified boolean formulae (QBF).☆38Updated 2 years ago
- The LTSmin model checking toolset☆59Updated 11 months ago
- Verimag Polyhedra Library☆18Updated 6 months ago
- A best-first-search theorem prover implemented in Isabelle☆34Updated 3 years ago
- Benchmark problems for different models of automata, transducers, and related logics☆30Updated last week
- Synthesis Format Conversion Tool☆26Updated last week
- ☆58Updated 3 months ago
- Lisa is a tool for (a). An LTLf to DFA conversion, and (b) An LTLf synthesis tool. Lisa supports both explicit and symbolic state-space r…☆12Updated 4 years ago
- BoSy is a reactive synthesis tool based on constraint-solving☆19Updated 2 years ago
- descartes: the cartesian hoare logic prover☆12Updated 8 years ago
- An automated theorem prover that uses Büchi automata.☆43Updated 4 years ago
- Proof-of-concept formal verification using Hoare logic☆21Updated 5 years ago
- ☆20Updated 2 years ago
- Python bindings for the Coq interactive proof assistant☆56Updated 3 years ago
- SRI Sally: A model checker for infinite-state systems.☆75Updated 2 months ago
- A simple Python Boolean library that can parse and manipulate dimacs as well as a custom language. Try some of the features out online he…☆10Updated 10 years ago
- AE-solver and Skolemizer☆17Updated 10 months ago
- VATA Tree Automata Library☆33Updated last year
- Fully proved small C functions (examples for verification course).☆16Updated 8 years ago
- A set of basic tools for manipulating SyGuS benchmarks☆25Updated 2 years ago
- Multi-core Decision Diagram (BDD/LDD) implementation☆43Updated last year
- Specify and synthesize systems using symbolic algorithms☆50Updated 11 months ago
- A language for symbolic transitions system, inspired by Ivy.☆70Updated last month
- Pedagogical first-order prover in Python☆76Updated 4 months ago