Toggle Main Menu Toggle Search

ePrints

Patterns for Refinement Automation

Lookup NU author(s): Dr Alexei Iliasov, Dr Elena Troubitsyna, Professor Alexander Romanovsky

Downloads

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


Abstract

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.


Publication metadata

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 Name: Formal Methods for Components and Objects: 8th International Symposium (FMCO 2009)

Year of Conference: 2010

Pages: 70-88

Publisher: Springer

URL: http://dx.doi.org/10.1007/978-3-642-17071-3_4

DOI: 10.1007/978-3-642-17071-3_4

Notes: Revised selected paper.

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783642170706


Actions

Link to this publication


Share