Skip to main content
Log in

ZRC – A Refinement Calculus for Z

  • Original Paper
  • Published:
Formal Aspects of Computing

Abstract.

The fact that Z is a specification language only, with no associated program development method, is a widely recognised problem. As an answer to that, we present ZRC, a refinement calculus based on Morgan's work that incorporates the Z notation and follows its style and conventions. This work builds upon existing refinement techniques for Z, but distinguishes itself mainly in that ZRC is completely formalised. In this paper, we explain how programs can be derived from Z specifications using ZRC. We present ZRC-L, the language of our calculus, and its conversion laws, which are concerned with the transformation of Z schemas into programs of this language. Moreover, we present the weakest precondition semantics of ZRC-L, which is the basis for the derivation of the laws of ZRC. More than a refinement calculus, ZRC is a theory of refinement for Z.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received July 1997 / Accepted in revised form October 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cavalcanti, A., Woodcock, J. ZRC – A Refinement Calculus for Z. Form Aspects Comput 10, 267–289 (1998). https://doi.org/10.1007/s001650050016

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001650050016

Navigation