Abstract
Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imposed by refinement, and for which the proof obligations feature additional predicates for accommodating design data. Composition mechanisms for retrenchment are studied. Vertical, horizontal, dataflow, parallel and fusion compositions are described. Of particular note are the means by which the additional predicates compose. It is argued that all of the compositions introduced are associative, and that they are mutually coherent. Composition of retrenchment with refinement, so important for the smooth interworking of the two techniques, is discussed. Decomposition, allowing finer grained retrenchments to be extracted from a single large grained retrenchment, is also investigated. © 2007 Elsevier Inc. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 209-229 |
Number of pages | 20 |
Journal | Journal of Logic and Algebraic Programming |
Volume | 75 |
Issue number | 2 |
DOIs | |
Publication status | Published - Apr 2008 |
Keywords
- Composition
- Decomposition
- Model evolution
- Refinement
- Requirements engineering
- Retrenchment