Reusing formal models via lifting
Reusing formal models via lifting
Formal modelling methods rightly focus on the primary goal of verifying properties. This can however, lead to inadequate facilities for structuring the model into manageable verification components. For example, the Event-B language is designed to achieve a high level of automatic theorem proofs through a linear sequence of refinements. In previous work, we introduced a mechanism to structure models via an inclusion mechanism using event synchronisations but this did not deal with generalised instantiations of a model component. Here we introduce a lifting mechanism that can be used in conjunction with inclusion to introduce multiple instances of a separately verified model lifted to an arbitrary set of instances. This allows localised properties to be proven without the complications caused by multiple instances as well as enhancing the usability of the inclusion feature.
Component lifting, Composition diagram, Event B, Machine inclusion
189-192
Dghaym, Dana
b7b69fe2-c9ff-43ad-a6ba-8b41d6fd19fc
Snook, Colin
b2055316-9f7a-4b31-8aa1-be0710046af2
Hoang, Thai Son
dcc0431d-2847-4e1d-9a85-54e4d6bab43f
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
27 December 2018
Dghaym, Dana
b7b69fe2-c9ff-43ad-a6ba-8b41d6fd19fc
Snook, Colin
b2055316-9f7a-4b31-8aa1-be0710046af2
Hoang, Thai Son
dcc0431d-2847-4e1d-9a85-54e4d6bab43f
Butler, Michael
54b9c2c7-2574-438e-9a36-6842a3d53ed0
Dghaym, Dana, Snook, Colin, Hoang, Thai Son and Butler, Michael
(2018)
Reusing formal models via lifting.
In Proceedings - 23rd International Conference on Engineering of Complex Computer Systems, ICECCS 2018.
vol. 2018-December,
IEEE.
.
(doi:10.1109/ICECCS2018.2018.00029).
Record type:
Conference or Workshop Item
(Paper)
Abstract
Formal modelling methods rightly focus on the primary goal of verifying properties. This can however, lead to inadequate facilities for structuring the model into manageable verification components. For example, the Event-B language is designed to achieve a high level of automatic theorem proofs through a linear sequence of refinements. In previous work, we introduced a mechanism to structure models via an inclusion mechanism using event synchronisations but this did not deal with generalised instantiations of a model component. Here we introduce a lifting mechanism that can be used in conjunction with inclusion to introduce multiple instances of a separately verified model lifted to an arbitrary set of instances. This allows localised properties to be proven without the complications caused by multiple instances as well as enhancing the usability of the inclusion feature.
This record has no associated files available for download.
More information
Published date: 27 December 2018
Venue - Dates:
23rd International Conference on Engineering of Complex Computer Systems, ICECCS 2018, , Melbourne, Australia, 2018-12-12 - 2018-12-14
Keywords:
Component lifting, Composition diagram, Event B, Machine inclusion
Identifiers
Local EPrints ID: 428578
URI: http://eprints.soton.ac.uk/id/eprint/428578
PURE UUID: 7a9d04d3-2a0e-4a08-a06b-9fa28fd7c760
Catalogue record
Date deposited: 01 Mar 2019 17:30
Last modified: 18 Mar 2024 03:40
Export record
Altmetrics
Contributors
Author:
Dana Dghaym
Author:
Colin Snook
Author:
Thai Son Hoang
Author:
Michael Butler
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics