Filtering Retrenchments into Refinements

Banach, Richard; Derrick, John

doi:10.1109/sefm.2006.17

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Z, B and so on) is frequently found to be too restrictive or conservative [6,5] in that it does not recognise as a refinement some useful and uncontroversial development steps.…”

Section: Resultsmentioning

confidence: 99%

Feature Refinement

Reeves

Streader

2007

Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)

View full text Add to dashboard Cite

Development by formal stepwise refinement offers a guarantee that an implementation satisfies a specification. But refinement is frequently defined in such a restrictive way as to disallow some useful development steps. Here we define feature refinement to overcome some limitations of refinement and show its usefulness by applying it to examples taken from the literature.Using partial relations as a canonical state-based semantics and labelled transition systems as a canonical event-based semantics, we define functions formally linking the state-and event-based operational semantics. We can then use this link to move notions of refinement between the event-and state-based worlds.An advantage of this abstract approach is that it is not restricted to a specific syntax or even a specific interpretation of the operational semantics

show abstract

“…Z, B and so on) is frequently found to be too restrictive or conservative [6,5] in that it does not recognise as a refinement some useful and uncontroversial development steps.…”

Section: Resultsmentioning

confidence: 99%