Skip to main content

Recent Advances in Refinement

  • Conference paper
  • First Online:
Abstract State Machines 2003 (ASM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2589))

Included in the following conference series:

Abstract

In this paper we survey recent work on generalising refinement in a state-based setting. Such generalisations challenge a number of assumptions embedded in the standard formalisation of Refinement in a language such as Z, and lead to simulation conditions that allow one to verify a refinement in a number of different contexts.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Aceto. Action Refinement in Process Algebras. CUP, London, 1992. 46

    MATH  Google Scholar 

  2. E.A. Boiten and J. Derrick. Grey box data Refinement. In Grundy et al. [16], pages 45–59. 42

    Google Scholar 

  3. E.A. Boiten and J. Derrick. IO-refinement in Z. In A. Evans, D.J. Duke, and T. Clark, editors, 3rd BCS-FRCS Northern Formal Methods Workshop. Springer-Verlag, September 1998. http://www.ewic.org.uk/. 40, 41

  4. E.A. Boiten and J. Derrick. Liberating data Refinement. In R.C. Backhouse and J.N. Oliveira, editors, Mathematics of Program Construction, volume 1837 of Lecture Notes in Computer Science, pages 144–166. Springer-Verlag, 2000. 39

    Chapter  Google Scholar 

  5. C. Bolton and J. Davies. A Singleton Failures Semantics for Communicating Sequential Processes. Formal Aspects of Computing, 2002. Under consideration. 52

    Google Scholar 

  6. C. Bolton and J. Davies. Refinement in Object-Z and CSP. In M. Butler, L. Petre, and K. Sere, editors, Integrated FormalMet hods (IFM 2002), volume 2335 of Lecture Notes in Computer Science, pages 225–244. Springer-Verlag, 2002. 52

    Google Scholar 

  7. J.W. de Bakker and E.P. de Vink. Bisimulation semantics for concurrency with atomicity and action refinement. Fundamenta Informaticae, 20:3–34, 1994. 46

    MATH  MathSciNet  Google Scholar 

  8. W.-P. de Roever and K. Engelhardt. Data Refinement: Model-Oriented Proof Methods and their Comparison. CUP, 1998. 37

    Google Scholar 

  9. J. Derrick and E.A. Boiten. Non-atomic refinement in Z. volume 1708 of Lecture Notes in Computer Science, pages 1477–1496, Berlin, 1999. Springer-Verlag. 46

    Google Scholar 

  10. J. Derrick and E.A. Boiten. Refinement of state-based systems with internal operations. Technical report, Computing Laboratory, University of Kent, Canterbury, 2000. 44

    Google Scholar 

  11. J. Derrick and E.A. Boiten. Refinement in Z and Object-Z. Springer-Verlag, 2001. 35, 37, 39, 40, 41, 45, 46

    Google Scholar 

  12. J. Derrick, E.A. Boiten, H. Bowman, and M. W. A. Steen. Weak Refinement in Z. In J. P. Bowen, M.G. Hinchey, and D. Till, editors, ZUM’97: The Z Formal Specification Notation, volume 1212 of Lecture Notes in Computer Science, pages 369–388. Springer-Verlag, April 1997. 45

    Chapter  Google Scholar 

  13. J. Derrick, E.A. Boiten, H. Bowman, and M. W. A. Steen. Specifying and Re-fining InternalO perations in Z. Formal Aspects of Computing, 10:125–159, December 1998. 45, 46

    Google Scholar 

  14. J. Derrick and E.A. Boiten. Refinement of objects and operations in Object-Z. In FormalMet hods for Open Object-based Distributed Systems IV, pages 257–277. Kluwer Academic Publishers, 2000. 46

    Google Scholar 

  15. J. Derrick and E.A. Boiten. Unifying concurrent and relational Refinement. In REFINE-a FloC’02 FME workshop, Electronic Notes in Theoretical Computer Science. Elsevier, 2002. 52, 53

    Google Scholar 

  16. J. Grundy, M. Schwenke, and T. Vickers, editors. International Refinement Workshop & Formal Methods Pacific’ 98. Discrete Mathematics and Theoretical Computer Science. Springer-Verlag, Canberra, September 1998.

    Google Scholar 

  17. He Jifeng, C.A.R. Hoare, and J.W. Sanders. Data Refinement refined. In B. Robinet and R. Wilhelm, editors, Proc. ESOP 86, volume 213, pages 187–196. Springer-Verlag, 1986. 37

    Google Scholar 

  18. He Jifeng. Process Refinement. In J. McDermid, editor, The Theory and Practice of Refinement. Butterworths, 1989. 52

    Google Scholar 

  19. M.B. Josephs. A state-based approach to communicating processes. Distributed Computing, 3:9–18, 1988. 52

    Article  MATH  Google Scholar 

  20. R. Miarka, E.A. Boiten, and J. Derrick. Guards, preconditions and Refinement in Z. In J. P. Bowen, S. Dunne, A. Galloway, and S. King, editors, ZB2000: Formal Specification and Development in Z and B, volume 1878 of Lecture Notes in Computer Science, pages 286–303. Springer-Verlag, September 2000. 36

    Chapter  Google Scholar 

  21. A. W. Roscoe. The Theory and Practice of Concurrency. International Series in Computer Science. Prentice-Hall, 1998. 52

    Google Scholar 

  22. G. Smith and J. Derrick. Abstract specification in Object-Z and CSP. In ICFEM’02, Lecture Notes in Computer Science. Springer-Verlag, 2002. 54

    Google Scholar 

  23. S. Stepney, D. Cooper, and J.C.P. Woodcock. More powerfulda ta Refinement in Z. In J.P. Bowen, A. Fett, and M.G. Hinchey, editors, ZUM’98: The Z Formal Specification Notation, volume 1493 of Lecture Notes in Computer Science, pages 284–307. Springer-Verlag, September 1998. 51, 54

    Chapter  Google Scholar 

  24. J.C. P. Woodcock. Industrial-strength Refinement. In Grundy et al. [16], pages 33–44. 54

    Google Scholar 

  25. J.C. P. Woodcock and J. Davies. Using Z: Specification, Refinement, and Proof. Prentice Hall, 1996. 39

    Google Scholar 

  26. J. C. P. Woodcock and C.C. Morgan. Refinement of state-based concurrent systems. In D. Bjorner, C.A.R. Hoare, and H. Langmaack, editors, VDM’90: VDM and Z!-Formal Methods in Software Development, volume 428 of Lecture Notes in Computer Science. Springer-Verlag, 1990. 52

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Derrick, J., Boiten, E. (2003). Recent Advances in Refinement. In: Börger, E., Gargantini, A., Riccobene, E. (eds) Abstract State Machines 2003. ASM 2003. Lecture Notes in Computer Science, vol 2589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36498-6_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-36498-6_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00624-4

  • Online ISBN: 978-3-540-36498-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics