Hi,
I'd like to announce the first public release of the 'boolean expression
simplifier' library "bes".
It is an implementation of several algorithms for minimizing boolean
expressions similar to the espresso solver [1] -- though in OCaml.
The source code is available on ocamlforge under the new
Hello,
I'm curious, what is it used for?
Is it for people doing proof checkers or things like this?
Thanks,
F.
On 04/19/2012 07:26 AM, "Markus W. Weißmann" wrote:
Hi,
I'd like to announce the first public release of the 'boolean expression simplifier'
library "bes".
It is an implementation
Hello,
On 19 Apr 2012, at 02:56, Francois Berenger wrote:
> I'm curious, what is it used for?
>
> Is it for people doing proof checkers or things like this?
>
Like that, yes:
We successfully use it for reducing the size of programs we want to perform
model checking on. My concrete target are
