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 …

TLA+ is a language for formal specification of concurrent and distributed protocols. TLA+ is
extremely concise yet expressive: The language primitives include Booleans, integers …

The need to provide formal guarantees about the behaviour of the algorithms underpinning
modern distributed systems became evident in recent years. This interest made apparent the …

Partial order reduction (POR) has considerable potential to reduce the state space during
model checking by exploiting independence between transitions. This potential remains …

The B method is a formal method supported by a variety of tools. Those tools, like any
complex piece of software, may suffer from performance issues and vulnerabilities …

Blockchain technologies have drawn significant attention from both academia and industry
over the last decade, with increasing adoption by the general public and potential to …

The safety of software systems is gaining importance due to the almost indispensable
integration of software in modern everyday life. Formal methods are a fundamental …

In this paper I explore a further option for solving B constraints. In particular, I develop a
framework translating B predicates to s (CASP), a goal-directed form of Answer Set …