smbcversion
Sat Modulo Bounded Checking
A model finder for a purely functional language with unknowns, similar to functional logic programming. It relies on a SAT solver (msat) to prune the search space efficiently.
Tags | logic narrowing model smt |
---|---|
Author | Simon Cruanes |
Published | |
Homepage | https://github.com/c-cube/smbc |
Issue Tracker | https://github.com/c-cube/smbc/issues |
Maintainer | simon.cruanes@inria.fr |
Dependencies |
|
Source [http] | https://github.com/c-cube/smbc/archive/0.3.1.tar.gz sha256=99d9e3b339b9161b84625601209ff5d35b51d96f90efe08981bf17cff88ca036 md5=fa60725a8580bd620add0179ab08719f |
Edit | https://github.com/ocaml/opam-repository/tree/master/packages/smbc/smbc.0.3.1/opam |
No package is dependent