| dc.contributor.author | Reeves, Steve | |
| dc.contributor.author | Streader, David | |
| dc.date.accessioned | 2013-11-22T03:18:22Z | |
| dc.date.available | 2013-11-22T03:18:22Z | |
| dc.date.copyright | 2008-05-10 | |
| dc.date.issued | 2008 | |
| dc.identifier.citation | Reeves, 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.uri | https://hdl.handle.net/10289/8223 | |
| dc.description.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. | en_NZ |
| dc.language.iso | en | en_NZ |
| dc.publisher | Springer | en_NZ |
| dc.relation.ispartof | Formal Aspects of Computing | |
| dc.relation.uri | http://link.springer.com/article/10.1007%2Fs00165-008-0076-5 | en_NZ |
| dc.subject | data refinement | en_NZ |
| dc.subject | singleton failures refinement | en_NZ |
| dc.title | Data refinement and singleton failures refinement are not equivalent | en_NZ |
| dc.type | Journal Article | en_NZ |
| dc.identifier.doi | 10.1007/s00165-008-0076-5 | en_NZ |
| dc.relation.isPartOf | Formal Aspects of Computing | en_NZ |
| pubs.begin-page | 295 | en_NZ |
| pubs.elements-id | 32950 | |
| pubs.end-page | 301 | en_NZ |
| pubs.issue | 3 | en_NZ |
| pubs.volume | 20 | en_NZ |
