Incompleteness of Relational Simulations in the Blocking Paradigm

Boiten, Eerke Albert and Derrick, John (2010) Incompleteness of Relational Simulations in the Blocking Paradigm. Science of Computer Programming, 75 (12). pp. 1262-1269. ISSN 0167-6423. (doi: (Full text available)

PDF (NOTICE: this is the author’s version of a work that was accepted for publication in Science of Computer Programming. Changes resulting from the publishing process may not be reflected in this document.) - Author's Accepted Manuscript
Download (210kB) Preview
Official URL


Refinement is the notion of development between formal specifications. For specifications given in a relational formalism, downward and upward simulations are the standard method to verify that a refinement holds, their usefulness based upon their soundness and joint completeness. This is known to be true for total relational specifications and has been claimed to hold for partial relational specifications in both the non-blocking and blocking interpretations. In this paper we show that downward and upward simulations in the blocking interpretation, where domains are ''guards'', are not jointly complete. This contradicts earlier claims in the literature. We illustrate this with an example (based on one recently constructed by Reeves and Streader) and then construct a proof to show why joint completeness fails in general.

Item Type: Article
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: E.A. Boiten
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 07 Aug 2018 09:31 UTC
Resource URI: (The current URI for this page, for reference purposes)
Boiten, Eerke Albert:
  • Depositors only (login required):


Downloads per month over past year