ProB provides a constraint solver for the B-method written in Prolog and can make use of
different backends based on SAT and SMT solving. One such backend translates B and …

ProB provides a constraint solver for the B-method written in Prolog and optionally can make
use of different backends based on SAT or SMT solving. One such solver integration …

We present the integration of the Kodkod high-level interface to SAT-solvers into the kernel
of ProB. As such, predicates from B, Event-B, Z and TLA+ can be solved using a mixture of …

PROB is a model checker for high-level B and Event-B models based on constraint-solving.
In this paper we investigate alternate approaches for validating high-level B models using …

We present an integration of the constraint solving kernel of the ProB model checker with the
SMT solver Z3. We apply the combined solver to B and Event-B predicates, featuring higher …

In this paper, we present recent developments in the Alt-Ergo SMT-solver to efficiently
discharge proof obligations (POs) generated by Atelier B. This includes a new plugin …

Formal development in Event-B generally requires the validation of a large number of proof
obligations. Some tools automatically discharge a significant part of them, thus augmenting …

Software development in B and Event-B generates proof obligations that have to be
discharged using theorem provers. The cost of such developments depends directly on the …

We evaluate the strengths and weaknesses of different backends of the ProB constraint
solver. For this, we train a random forest over a database of constraints to classify whether a …

We present PROB, an animation and model checking tool for the B method. PROB's
animation facilities allow users to gain confidence in their specifications, and unlike the …