Skip to main content

Perspicuity and Granularity in Refinement

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
Click to download this file (108kB) Preview
[thumbnail of stuttereptcs.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


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

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: (The current URI for this page, for reference purposes)
Boiten, Eerke Albert:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.