Structuring Retrenchments in B by Decomposition


Poppleton, Michael R, and Banach, Richard N. (2003) Structuring Retrenchments in B by Decomposition. In, FME2003: International Symposium of Formal Methods Europe, Pisa, Italy, Springer Lecture Notes in Computer Science, 814-833.

Download

[img] Postscript
Download (177Kb)

Description/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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Event Dates: September
ISSNs: 0302-9743
Related URLs:
Keywords: formal methods, refinement, requirements, retrenchment, validation
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
ePrint ID: 258440
Date Deposited: 04 Nov 2003
Last Modified: 27 Mar 2014 20:00
Publisher: Springer Lecture Notes in Computer Science
Further Information:Google Scholar
ISI Citation Count:3
URI: http://eprints.soton.ac.uk/id/eprint/258440

Actions (login required)

View Item View Item