After a number of success stories in safety‐critical domains, we are starting to witness
applications of formal methods in contemporary systems and software engineering …

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 a solver for a first-order logic language where sets and binary
relations can be freely and naturally combined. The language can express, at least, any full …

Satisfiability checking aims to develop algorithms and tools for checking the satisfiability of
existentially quantified logical formulas. Besides powerful SAT solvers for solving …

The development of cyber-physical systems has become one of the biggest challenges in
the field of model-based system engineering. The difficulty stems from the complex nature of …

We have implemented various symbolic model checking algorithms, such as BMC, k-
Induction and IC3 for B, Event-B and other modeling languages. The high-level nature of …

Well-Definedness is important for many formal methods. In B and Event-B it ensures that
certain kinds of errors (eg, division by 0) cannot appear and that proof rules based on two …

In this paper we present a decision procedure for sets, binary relations and partial functions.
The language accepted by the decision procedure includes untyped, hereditarily finite sets …

We briefly present the motivation, architecture and usage experience as well as proof
statistics for a new Rodin Platform proof back-end based on the Why3 umbrella prover …

The decentralised railway signalling systems have a potential to increase capacity,
availability and reduce maintenance costs of railway networks. However, given the safety …