Proving Event-B Models with Reusable Generic Lemmas

Iliasov, A; Stankaitis, P; Romanovsky, A

doi:10.1007/978-3-319-47846-3_14

Proving Event-B Models with Reusable Generic Lemmas

Lookup NU author(s): Dr Alexei Iliasov, Dr Paulius Stankaitis, Emeritus Professor Alexander Romanovsky ORCiD

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

Event-B is one of more popular notations for model-based, proof-driven specification. It offers a fairly high-level mathematical language based on FOL and ZF set theory and an economical yet expressive modelling notation. Model correctness is established by proving a number of conjectures constructed via a syntactic instantiation of schematic conditions. A significant part of provable conjectures requires proof hints from a user. For larger models this becomes extremely onerous as identical or similar proofs have to be repeated over and over, especially after model refactoring stages. In the paper we discuss an approach to making proofs more generic and thus less fragile and more reusable. The crux of the technique is offering an engineer an opportunity to complete a proof by positing and proving a generic lemma that may be reused in the same or even another project. To assess the technique potential we have developed a plug-in to the Rodin Platform and used it to prove a number of pre-existing Event-B models.