Skip to main content
SpringerLink
Log in

Data refinement and singleton failures refinement are not equivalent

  • Original Article
  • Published:
Formal Aspects of Computing

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bolton C, Davies J (2001) A singleton failures semantics for Communicating Sequential Processes. Research Report PRG-RR-01-11, Oxford University Computing Laboratory

  2. Boiten E, Derrick J (2002) Unifying concurrent and relational refinement. In: Derrick J, Boiten E, Woodcock J, von Wright J (eds) REFINE 02: The BCS FACS Refinement Workshop. Electronic Notes in Theoretical Computer Science, vol 70(3). Elsevier Science Publishers, Amsterdam

  3. Bolton C, Davies J (2002) A comparison of refinement orderings and their associated simulation rules. In: Derrick J, Boiten E, Woodcock J, von Wright J (eds) Electronic Notes in Theoretical Computer Science, vol 70. Elsevier, Amsterdam

    Google Scholar 

  4. Bolton C, Davies J (2006) A singleton failures semantics for communicating sequential processes. Form Asp Comput 18(2): 181–210

    Article  MATH  Google Scholar 

  5. Derrick J, Boiten E (2001) Refinement in Z and Object-Z: Foundations and Advanced Applications. Formal Approaches to Computing and Information Technology. Springer, Berlin

  6. Derrick J, Boiten E (2003) Relational concurrent refinement. Form Asp Comput 15(2–3):182–214

    Article  MATH  Google Scholar 

  7. Dunne S, Conroy S (2005) Process refinement in B. In: Treharne H, King S, Henson MC, Schneider S (eds) ZB 2005: Formal Specification and Development in Z and B, 4th International Conference of B and Z Users. Lecture Notes in Computer Science, vol 3455. Springer, Berlin, pp 45–64

  8. de Roever WP, Engelhardt K (1998) Data refinement: model oriented proof methods and their comparison, Cambridge tracts in theoretical computer science 47. Cambridge University Press

  9. He J, Hoare CAR, Sanders JW (1986) Data refinement refined. In: Proceedings of the European symposium on programming on ESOP 86, New York, NY, USA. Springer, New York, pp 187–196

  10. Roscoe WA (1998) Theory and Practice of Concurrency. Prentice-Hall

  11. Reeves S, Streader D (2003) Comparison of data and process refinement. In: Woodcock JCP, Dong JS (eds) Proceedings of ICFEM. Lecture Notes in Computer Science, vol 2885. Springer, Berlin, pp 266–285

    Google Scholar 

  12. Woodcock J, Davies J (1996) Using Z: specification, refinement and proof. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waikato, Hamilton, New Zealand

    Steve Reeves & David Streader

Authors
  1. Steve Reeves
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Streader
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Steve Reeves or David Streader.

Additional information

C.B. Jones

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reeves, S., Streader, D. Data refinement and singleton failures refinement are not equivalent. Form Asp Comp 20, 295–301 (2008). https://doi.org/10.1007/s00165-008-0076-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-008-0076-5

Keywords

Search

Navigation