SMPT is a SMT-based model checker for Petri nets focused on reachability problems that takes advantage of net reductions (polyhedral reductions).
-
Updated
Jun 30, 2025 - Python
SMPT is a SMT-based model checker for Petri nets focused on reachability problems that takes advantage of net reductions (polyhedral reductions).
A friendly functional language for finding counterexamples 🎯
Find soundness bugs in SMT solvers through equivalent transformations
PARQ is an automatic parallelization engine based on Skolem Function Synthesis and Quantified Invariant Generation. It is aimed at parallelization of array modifying programs written as Constrained Horn Clause (CHC) formulas.
Verification of the Total Coloring Conjecture for all graphs with at most 14 vertices using a SAT Modulo Symmetry Solver.
Add a description, image, and links to the smt-solving topic page so that developers can more easily learn about it.
To associate your repository with the smt-solving topic, visit your repo's landing page and select "manage topics."