Toggle Main Menu Toggle Search

Open Access padlockePrints

Proving Event-B models with reusable generic lemmas

Lookup NU author(s): Dr Alexei Iliasov, Paulius Stankaitis, Professor Alexander RomanovskyORCiD



This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).


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 Rodin Platform and used it to proof a number of pre-existing Event-B models.

Publication metadata

Author(s): Iliasov A, Stankaitis P, Romanovsky A

Editor(s): Kazuhiro Ogata, Mark Lawford, Shaoying Liu

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Formal Methods and Software Engineering: 18th International Conference on Formal Engineering Methods (ICFEM 2016)

Year of Conference: 2016

Pages: 210-225

Online publication date: 15/10/2016

Acceptance date: 29/06/2016

Date deposited: 12/12/2016

ISSN: 1611-3349

Publisher: Springer


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

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783319478463