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.4.1.tar.gz
sha256=340499644477e49b5a05879fb778847471122550eef04a08e05faab3ddf9ea81
md5=e02a268970ff6d19f153d31113c5c338
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/smbc/smbc.0.4.1/opam
No package is dependent