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.2007@m4x.org
Dependencies
Source [http] https://github.com/c-cube/smbc/archive/0.4.2.tar.gz
sha256=134dbdc2d92903dd01c72b7c1955fb053654810937edf7bd57b38828ac2b2685
md5=b966e738456a3b648a8e780dfcaf5f0c
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/smbc/smbc.0.4.2/opam
No package is dependent