Patterns for Refinement Automation (2010)

Author(s): Iliasov A, Troubitsyna E, Laibinis L, Romanovsky A

    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.

    Notes: Revised selected paper.

      • Date: 4-6 November 2009
      • Conference Name: Formal Methods for Components and Objects: 8th International Symposium (FMCO 2009)
      • Volume: 6286
      • Pages: 70-88
      • Publisher: Springer
      • Publication type: Conference Proceedings (inc. abstract)
      • Bibliographic status: Published

      Professor Alexander Romanovsky
      Prof of Computing Science