Data refinement and singleton failures refinement are not equivalent

Simple item page
dc.contributor.authorReeves, Steve
dc.contributor.authorStreader, David
dc.date.accessioned2013-11-22T03:18:22Z
dc.date.available2013-11-22T03:18:22Z
dc.date.copyright2008-05-10
dc.date.issued2008
dc.description.abstractIn 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.en_NZ
dc.identifier.citationReeves, S., & Streader, D. (2008). Data refinement and singleton failures refinement are not equivalent. Formal Aspects of Computing, 20(3), 295-301.en_NZ
dc.identifier.doi10.1007/s00165-008-0076-5en_NZ
dc.identifier.urihttps://hdl.handle.net/10289/8223
dc.language.isoenen_NZ
dc.publisherSpringeren_NZ
dc.relation.isPartOfFormal Aspects of Computingen_NZ
dc.relation.ispartofFormal Aspects of Computing
dc.relation.urihttp://link.springer.com/article/10.1007%2Fs00165-008-0076-5en_NZ
dc.subjectdata refinementen_NZ
dc.subjectsingleton failures refinementen_NZ
dc.titleData refinement and singleton failures refinement are not equivalenten_NZ
dc.typeJournal Articleen_NZ
pubs.begin-page295en_NZ
pubs.elements-id32950
pubs.end-page301en_NZ
pubs.issue3en_NZ
pubs.volume20en_NZ
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Name: license.txt
Size: 1.71 KB
Kind: License
Collections
Computing and Mathematical Sciences Papers