Data refinement and singleton failures refinement are not equivalent

Authors:
Steve Reeves;David Streader
Affiliations:
University of Waikato, Department of Computer Science, Hamilton, New Zealand;University of Waikato, Department of Computer Science, Hamilton, New Zealand
Venue:
Formal Aspects of Computing
Year:
2008

Citing 0
Cited 5

More Relational Concurrent Refinement: Traces and Partial Relations

Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling Divergence in Relational Concurrent Refinement

IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Relational Concurrent Refinement: Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Incompleteness of relational simulations in the blocking paradigm

Science of Computer Programming
From ODP viewpoint consistency to Integrated Formal Methods

Computer Standards & Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we give simple example abstract data types, with atomic operations, that are related by data refinement under a definition used widely in the literature, but these same abstract data types are not related by singleton failure refinement. This contradicts results found in the literature.