Foundations of the B method

Authors

  • Dominique Cansell
  • Dominique Mery

Keywords:

Events, actions, systems, refinement, proof, validation, formal method

Abstract

B is a method for specifying, designing and coding software systems. It is based on Zermelo-Fraenkel set theory with the axiom of choice, the concept of generalized substitution and on structuring mechanisms (machine, refinement, implementation). The concept of refinement is the key notion for developing B models of (software) systems in an incremental way. B models are accompanied by mathematical proofs that justify them. Proofs of B models convince the user (designer or specifier) that the (software) system is effectively correct. We provide a survey of the underlying logic of the B method and the semantic concepts related to the B method; we detail the B development process partially supported by the mechanical engine of the prover.

Downloads

Download data is not yet available.

Downloads

Published

2012-02-20

How to Cite

Cansell, D., & Mery, D. (2012). Foundations of the B method. Computing and Informatics, 22(3-4), 221–256. Retrieved from http://147.213.75.17/ojs/index.php/cai/article/view/456