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
AuthorSimon Cruanes
Published
Homepagehttps://github.com/c-cube/smbc
Issue Trackerhttps://github.com/c-cube/smbc/issues
Maintainersimon.cruanes@inria.fr
Dependencies
Source [http] https://github.com/c-cube/smbc/archive/0.2.tar.gz
sha256=f9e72428536db55d0709df2e4732c51baad89c63159488b62bd21db36287f294
md5=2b97164ca0866491bd27676c723d2b45
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/smbc/smbc.0.2/opam
No package is dependent