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.tar.gz
sha256=048555711bf469ad3f42d22af8dfed2c950c6849ccd7a750edb3d75f766c812a
md5=1bcf0d5564d97fbb41ccdf64f0c86668
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/smbc/smbc.0.4/opam
No package is dependent