Boiten, Eerke Albert (2011) Perspicuity and Granularity in Refinement. In: Derrick, John and Boiten, Eerke Albert and Reeves, Steve, eds. Proceedings 15th International Refinement Workshop. Electronic Proceedings in Theoretical Computer Science , 55. pp. 182-196. (doi:10.4204/EPTCS.55.10) (KAR id:30752)
PDF
Author's Accepted Manuscript
Language: English |
|
Download this file (PDF/108kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/204/EPTCS.55.10 |
Abstract
This paper reconsiders refinements which introduce actions on the concrete level which were not present at the abstract level. It draws a distinction between concrete actions which are ''perspicuous'' at the abstract level, and changes of granularity of actions between different levels of abstraction. The main contribution of this paper is in exploring the relation between these different methods of ''action refinement'', and the basic refinement relation that is used. In particular, it shows how the ''refining skip'' method is incompatible with failures-based refinement relations, and consequently some decisions in designing Event-B refinement are entangled. See http://eptcs.org/content.cgi?Refine2011.
Item Type: | Conference or workshop item (Paper) |
---|---|
DOI/Identification number: | 10.4204/EPTCS.55.10 |
Uncontrolled keywords: | determinacy analysis, Craig interpolants |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Eerke Boiten |
Date Deposited: | 21 Sep 2012 09:49 UTC |
Last Modified: | 16 Nov 2021 10:08 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/30752 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):