smbc
Sat Modulo Bounded Checking
Description
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.
Install
copied = false, 2000)"
:class="{ 'border-gray-700': !copied, 'text-gray-100': !copied, 'focus:ring-orange-500': !copied, 'focus:border-orange-500': !copied, 'border-green-600': copied, 'text-green-600': copied, 'focus:ring-green-500': copied, 'focus:border-green-500': copied }">
- Published
- 29 Aug 2017
- Authors
- Maintainers
Sources
Dependencies
tip-parser
>= "0.3" & < "0.4"
msat
>= "0.5" & < "0.8"
sequence
>= "0.4"
containers
>= "1.0" & < "2.0"
ocamlfind
build
ocaml
>= "4.01"
Reverse Dependencies