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.tar.gz sha256=90064ae382fd4c0ef50dde92e1925653f3a1b63167279d4bf1880b91d2e42343 md5=8ec10b9dd584c9ba952c1802cbb5f359 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/smbc/smbc.0.3/opam |
No package is dependent
