Affiliation:
1. Oxford University Computing Laboratory, Oxford UK, GB
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science,Software
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. UTP, Circus, and Isabelle;Theories of Programming and Formal Methods;2023
2. Circus2CSP: A Tool for Model-Checking Circus Using FDR;Lecture Notes in Computer Science;2019
3. Towards a Model-Checker for Circus;Lecture Notes in Computer Science;2019
4. Conclusions;Refinement;2018
5. Java in the Safety-Critical Domain;Engineering Trustworthy Software Systems;2017