Utilities for abstract syntax trees and parsing with PLY.
Binary decision diagrams implemented in pure Python, as well as Cython wrappers of CUDD, Sylvan, and BuDDy.
Symbolic algorithms for solving games of infinite duration.
Generalized reactive(1) synthesis from Promela specifications.
Parser and abstract syntax tree for the Promela modeling language.
Create C call graphs from multiple source files using Cflow, producing linked PDF.
Python interface to Graphviz's Dot
Parser and abstract syntax tree for the temporal logic of actions TLA+.