The University of Southampton
University of Southampton Institutional Repository

Structuring Retrenchments in B by Decomposition

Structuring Retrenchments in B by Decomposition
Structuring Retrenchments in B by Decomposition
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [ref] as a liberalization of classical refinement, for the formal description of application developments too demanding for refinement. This work initiates the study of the structuring of retrenchment-based developments in B by decomposition. A given coarse-grained retrenchment relation between specifications is decomposed into a family of more fine-grained retrenchments. The resulting family may distinguish more incisively between refining, approximately refining, and non-refining behaviours. Two decomposition results are given, each sharpening a coarse-grained retrenchment within a particular syntactic structure for operations at concrete and abstract levels. A third result decomposes a retrenchment exploiting structure latent in both levels. The theory is illustrated by a simple example based on an abstract model of distributed computing, and methodological aspects are considered.
formal methods, refinement, requirements, retrenchment, validation
814-833
Poppleton, Michael R,
4c60e63f-188c-4636-98b9-de8a42789b1b
Banach, Richard N.
2913b100-941d-4cdf-83f0-9a1419113708
Araki, Keijiro
e5c785ab-217e-4960-b7da-7eb5a9aa5362
Gnesi, Stefania
31c99bd0-83b5-4ac9-9fe6-ac56e41065c2
Mandrioli, Dino
0787ff35-2fa5-4610-91db-c12869c1ba36
Poppleton, Michael R,
4c60e63f-188c-4636-98b9-de8a42789b1b
Banach, Richard N.
2913b100-941d-4cdf-83f0-9a1419113708
Araki, Keijiro
e5c785ab-217e-4960-b7da-7eb5a9aa5362
Gnesi, Stefania
31c99bd0-83b5-4ac9-9fe6-ac56e41065c2
Mandrioli, Dino
0787ff35-2fa5-4610-91db-c12869c1ba36

Poppleton, Michael R, and Banach, Richard N., (2003) Structuring Retrenchments in B by Decomposition Araki, Keijiro, Gnesi, Stefania and Mandrioli, Dino (eds.) At FME2003: International Symposium of Formal Methods Europe, Italy. , pp. 814-833.

Record type: Conference or Workshop Item (Paper)

Abstract

Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [ref] as a liberalization of classical refinement, for the formal description of application developments too demanding for refinement. This work initiates the study of the structuring of retrenchment-based developments in B by decomposition. A given coarse-grained retrenchment relation between specifications is decomposed into a family of more fine-grained retrenchments. The resulting family may distinguish more incisively between refining, approximately refining, and non-refining behaviours. Two decomposition results are given, each sharpening a coarse-grained retrenchment within a particular syntactic structure for operations at concrete and abstract levels. A third result decomposes a retrenchment exploiting structure latent in both levels. The theory is illustrated by a simple example based on an abstract model of distributed computing, and methodological aspects are considered.

Archive (ZIP) Struc.Ret.B.Decomp.zip - Other
Download (181kB)

More information

Published date: 2003
Additional Information: Event Dates: September
Venue - Dates: FME2003: International Symposium of Formal Methods Europe, Italy, 2003-09-01
Keywords: formal methods, refinement, requirements, retrenchment, validation
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 258440
URI: http://eprints.soton.ac.uk/id/eprint/258440
PURE UUID: d5c2573d-a762-42ea-92e6-fe3515d62f06

Catalogue record

Date deposited: 04 Nov 2003
Last modified: 18 Jul 2017 09:32

Export record

Contributors

Author: Michael R, Poppleton
Author: Richard N. Banach
Editor: Keijiro Araki
Editor: Stefania Gnesi
Editor: Dino Mandrioli

University divisions

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×