Samuel Colin

Duration calculus: a real-time semantic for B

Among the possible approaches for expressing real-time problems with the B method, two are dominant : the use of the usual B mechanisms to define real-time constraints on the one hand, and extending B through another formalism more adapted to the real-time context on the other hand. We define here a possible real-time semantic for B, by using a real-time logic (the duration calculus), and we illustrate how this extension affects the proof mechanism used to show the soundness of abstract machines.

BRILLANT: an open source and XML-based platform for rigourous software development

The need for the B method first appeared in industry, and several commercial tools have been developed to support this formalism. However, few of these tools allow reasoning on the formalism itself or on its possible extensions. This article presents an open-source platform, with a focus on the platforms core component, the BCaml project. The tools presented are used to show how very different approaches can be brought together around a central design to form a consistent toolbox, and can be used to develop safe systems, from their specifications to their validation and the generation of safe code.

Relaxing b sharing restrictions within CSP

This paper addresses the issue of state sharing in CSP||B specifications: B machines controlled by various CSP parts are supposed not to refer to, share or modify the same state space. However, some kinds of B state sharing can be allowed without creating inconsistencies in CSP||B specifications. To achieve this, we present a B-based solution for allowing architectures with B state sharing in the CSP||B components. We show that the inconsistencies in state sharing can be identified by translating the CSP controllers into B specifications and then using a more refined consistency checking process. We also hint at possible extensions towards other CSP||B architectural patterns with various types of sub-components sharing.