A Calculus for Schemas in Z
Brien, S. M. and Martin, A. P. (2000) A Calculus for Schemas in Z. J. Symbolic Computation, to app
Full text not available from this repository.
The popularity and flexibility of the Z notation can largely be attributed to its notion of schemas. We describe these schemas and illustrate their various common uses in Z. We also present a collection of logical laws for manipulating these schemas. These laws are capable of supporting reasoning about the Z schema calculus in its full generality. This is demonstrated by presenting some theorems about the removability of schemas from Z specifications, together with outline proofs. We survey briefly models against which this logical system may be proven sound, and other related logics for Z.
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science
|Date Deposited:||22 Jun 1999|
|Last Modified:||01 Mar 2012 10:18|
|Contributors:||Brien, S. M. (Author)
Martin, A. P. (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)