Patterns for Refinement Automation

  1. Lookup NU author(s)
  2. Dr Alexei Iliasov
  3. Dr Elena Troubitsyna
  4. Professor Alexander Romanovsky
Author(s)Iliasov A, Troubitsyna E, Laibinis L, Romanovsky A
Editor(s)de Boer, FS; Bonsangue, MM; Hallerstede, S; Leuschel, M
Publication type Conference Proceedings (inc. Abstract)
Conference NameFormal Methods for Components and Objects: 8th International Symposium (FMCO 2009)
Conference LocationEindhoven, The Netherlands
Year of Conference2010
Source Publication Date4-6 November 2009
Series TitleLecture Notes in Computer Science
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Formal modelling is indispensable for engineering highly dependable systems. However, a wider acceptance of formal methods is hindered by their insufficientusability and scalability. In this paper, we aim at assisting developers in rigorous modelling and design by increasing automation of development steps. We introduce a notion of refinement patterns – generic representations of typicalcorrectness-preserving model transformations. Our definition of a refinement pattern contains a description of syntactic model transformations, as well as the pattern applicability conditions and proof obligations for verifying correctness preservation. This work establishes a basis for building a tool that would support formal system development via pattern reuse and instantiation. We present a prototype of such a tool and some examples of refinement patterns for automated development in the Event B formalism.
NotesRevised selected paper.
ActionsLink to this publication
Library holdingsSearch Newcastle University Library for this item