Skip to main content
SpringerLink
Log in

Comparison of Data and Process Refinement

  • Conference paper
Formal Methods and Software Engineering (ICFEM 2003)

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

Included in the following conference series:

Abstract

From what point of view is it reasonable, or possible, to refine a one place buffer into a two place buffer? In order to answer this question we characterise refinement based on substitution in restricted contexts. We see that data refinement (specifically in Z) and process refinement give differing answers to the original question, and we compare the precise circumstances which give rise to this difference by translating programs and processes into labelled transition systems, so providing a common basis upon which to make the comparison. We also look at the closely related area of sub-typing of objects. Along the way we see how all these sorts of computational construct are related as far as refinement is concerned, and discover and characterise some (as far as we can tell) new sorts of refinement.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. van Glabbeek, R.J.: The Linear Time - Branching Time Spectrum II. In: International Conference on Concurrency Theory, pp. 66–81 (1993)

    Google Scholar 

  2. Standard, I.: Open Distributed Processing - Reference Model. Technical Report ISO/IEC 10746-1(E), International Electrotechnical Commission (1998)

    Google Scholar 

  3. Kiczales, G., Lamping, J., Menhdhekar, A., Maeda, C., Lopes, C., Loingtier, J.M., Irwin, J.: Aspect-oriented programming. In: Aksit, M., Matsuoka, S. (eds.) ECOOP 1997. LNCS, vol. 1241, pp. 220–242. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Steen, M., Derrick, J., Boiten, E., Bowman, H.: Consistency of partial process specifications. In: Haeberer, A.M. (ed.) AMAST 1998. LNCS, vol. 1548, pp. 248–262. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18 (1990)

    Google Scholar 

  6. Roscoe, A.: The Theory and Practice of Concurrency. Prentice Hall International Series in Computer Science (1997)

    Google Scholar 

  7. Derrick, J., Bowman, H., Boiten, E., Steen, M.: Comparing LOTOS and Z refinement relations. In: FORTE/PSTV 1996, Kaiserslautern, Germany, pp. 501–516. Chapman & Hall, Boca Raton (1996)

    Google Scholar 

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

    Google Scholar 

  9. Bowman, H., Briscoe-Smith, C., Derrick, J., Strulo, B.: On behavioural subtyping in LOTOS (1997)

    Google Scholar 

  10. Winskel, G., Nielsen, M.: Models for concurrency. Technical Report DAIMI PB 429, Computer Science Dept. Aarhus Universty (1992)

    Google Scholar 

  11. Hoare, C.: Communicating Sequential Processes. Prentice Hall International Series in Computer Science (1985)

    Google Scholar 

  12. Brinksma, E., Scollo, G., Steenbergen, C.: LOTOS specifications, their implementation and their tests. In: Sarikaya, B., Bochmann, G.V. (eds.) Protocol Specification, Testing and Verification, vol. VI, pp. 349–360. North-Holland, Amsterdam (1986)

    Google Scholar 

  13. Hennessy, M.: Algebraic Theory of Processes. The MIT Press, Cambridge (1988)

    MATH  Google Scholar 

  14. Brinksma, E., Scollo, G.: Formal notions of implementation and conformance in LOTOS. Technical Report INF-86-13, Twente University of Technology, Department of Informatics, Enschede, The Netherlands (1986)

    Google Scholar 

  15. Fischer, C., Wehrheim, H.: Behavioural subtyping relations for object-oriented formalisms. In: Rus, T. (ed.) AMAST 2000. LNCS, vol. 1816, pp. 469–483. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Spivey, J.M.: The Z notation: A reference manual. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  17. Bolton, C., Davies, J.: 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 (2002)

    Google Scholar 

  18. Basten, T., van der Aalst, W.M.P.: Inheritance of behavior. JLAP 47, 47–145 (2001)

    MATH  Google Scholar 

  19. Nierstrasz, O.: Regular types for active objects. In: Nierstrasz, O., Tsichritzis, D. (eds.) Object-Oriented Software Composition, pp. 99–121. Prentice-Hall, Englewood Cliffs (1995)

    Google Scholar 

  20. Liskov, B., Wing, J.: Family values: a behavioral notion of subtyping. Technical Report MIT/LCS/TR-562b, Massachusetts Institute of Technology (1993)

    Google Scholar 

  21. He, J., Hoare, C., Sanders, J.: Data refinement refined. In: Robinet, B., Wilhelm, R. (eds.) ESOP 1986. LNCS, vol. 213, pp. 187–196. Springer, Heidelberg (1986)

    Google Scholar 

  22. Woodcock, J., Davies, J.: Using Z: Specification, Refinement and Proof. Prentice-Hall, Englewood Cliffs (1996)

    MATH  Google Scholar 

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

    Google Scholar 

  24. Deutsch, M., Henson, M., Reeves, S.: Results on Formal Stepwise Design in Z. In: Proceedings of APSEC2002. IEEE Computer Society, Los Alamitos (2002)

    Google Scholar 

  25. Smith, G.: A Semantic Integration of Object-Z and CSP for the Specification of Concurrent Systems. In: Fitzgerald, J.S., Jones, C.B., Lucas, P. (eds.) FME 1997. LNCS, vol. 1313, pp. 62–81. Springer, Heidelberg (1997)

    Google Scholar 

  26. Smith, G.: A Fully Abstract Semantics of Classes for Object-Z. Formal Aspects of Computing 7, 289–313 (1995)

    Article  Google Scholar 

  27. Derrick, J., Boiten, E., Bowman, H., Steen, M.: Specifying and Refining Internal Operations in Z. Formal Aspects of Computing 10, 125–159 (1998)

    Article  MATH  Google Scholar 

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

    Google Scholar 

  29. Woodcock, J., Morgan, C.: Refinement of state-based concurrent systems. In: Langmaack, H., Hoare, C.A.R., Bjorner, D. (eds.) VDM 1990. LNCS, vol. 428, pp. 340–351. Springer, Heidelberg (1990)

    Google Scholar 

  30. Hoare, C., Jifeng, H.: Unifying Theories of Programming. Prentice Hall International Series in Computer Science (1998)

    Google Scholar 

  31. Woodcock, J.C.P., Cavalcanti, A.L.C.: The Semantics of Circus. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) B 2002 and ZB 2002. LNCS, vol. 2272, pp. 184–203. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  32. Fischer, C.: How to combine Z with a process algebra. In: Bowen, J.P., Fett, A., Hinchey, M.G. (eds.) ZUM 1998. LNCS, vol. 1493, pp. 5–23. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  33. Bolton, C., Davies, J., Woodcock, J.: On the refinement and simulation of data types and processes. In: Arak, K., Galloway, A., Taguchi, K. (eds.) Proceedings of IFM 1999, pp. 273–292 (1999)

    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

Editor information

Editors and Affiliations

  1. School of Computing, National University of Singapore, Singapore

    Jin Song Dong

  2. University of York,  

    Jim Woodcock

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reeves, S., Streader, D. (2003). Comparison of Data and Process Refinement. In: Dong, J.S., Woodcock, J. (eds) Formal Methods and Software Engineering. ICFEM 2003. Lecture Notes in Computer Science, vol 2885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39893-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39893-6_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20461-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation