Boiten, E. and Derrick, J. (2010) Incompleteness of relational simulations in the blocking paradigm. Science of Computer Programming, 75 (12). pp. 1262-1269. ISSN 0167-6423
Abstract
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 (C) 2010 Elsevier B V All rights reserved
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2010 Elsevier. This is an author produced version of a paper subsequently published in Science of Computer Programming. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Relational refinement; Downward and upward simulations; Joint completeness; Failures refinement |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Miss Anthea Tucker |
Date Deposited: | 28 Jan 2011 09:52 |
Last Modified: | 08 Feb 2013 17:30 |
Published Version: | http://dx.doi.org/10.1016/j.scico.2010.07.003 |
Status: | Published |
Publisher: | Elsevier |
Refereed: | Yes |
Identification Number: | 10.1016/j.scico.2010.07.003 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:42816 |