## The formal method known as B and a sketch for its implementation (2002)

Citations: | 2 - 2 self |

### BibTeX

@MISC{Kaijanaho02theformal,

author = {Antti-Juhani Kaijanaho},

title = {The formal method known as B and a sketch for its implementation},

year = {2002}

}

### OpenURL

### Abstract

This thesis provides a reconstruction of the B-method and sketches an implementation of its tool support.For background, this work investigates the field of formal methods in general and the relevance of formal methods to software engineering in particular. Formal (first-order) logic is also considered: both its development and important points relevant to formal methods. Automated reasoning, particularly its theoretical limits as well as unification and resolution, is discussed. The main part of this thesis is a systematic reconstruction of the B-method, starting from its version of untyped predicate calculus and typed set theory, continuing with the Generalized Substitution Language (GSL) and finishing with the Abstract Machine Notation (AMN). Specification, refinement and implementation of a simple example using the B-method is presented. Both validation and verification of specifications, refinements and implementations using the B-method is discussed. The thesis concludes with a report of the current state of the effort (by the author) to implement the tool support of the B-method, as the Ebba Toolset. The main design decisions are discussed. The use of Unicode as the primary input encoding of AMN and GSL in Ebba is described.