Results 1 
2 of
2
Investigating Z
, 2000
"... In this paper we introduce and investigate an improved kernel logic ZC for the specification language Z. Unlike the standard accounts, this logic is consistent and is easily shown to be sound. We show how a complete schema calculus can be derived within this logic and in doing so we reveal a high de ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
In this paper we introduce and investigate an improved kernel logic ZC for the specification language Z. Unlike the standard accounts, this logic is consistent and is easily shown to be sound. We show how a complete schema calculus can be derived within this logic and in doing so we reveal a high degree of logical organisation within the language. Finally, our approach eschews all nonstandard concepts introduced in the standard approach, notably object level notions of substitution and entities which share properties both of constants and variables. We show, in addition, that these unusual notions are derivable in ZC and are, therefore, unnecessary innovations. Keywords: Specification language Z; Logic and semantics of specification languages. 1 Introduction In this paper we introduce and investigate an improved kernel logic ZC for the specification language Z, a logic in which, in particular, we can derive a schema calculus: a logic for the entire range of schema expressions permit...
µCharts and Z: hows, whys and wherefores
 in W. Grieskamp, T. Santen & B. Stoddart, eds, ‘Integrated Formal Methods 2000: Proceedings of the 2nd
, 2000
"... . In this paper we show, by a series of examples, how the  chart formalism can be translated into Z. We give reasons for why this an interesting and sensible thing to do and what it might be used for. 1 Introduction In this paper we show, by a series of examples, how the chart formalism (as gi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. In this paper we show, by a series of examples, how the  chart formalism can be translated into Z. We give reasons for why this an interesting and sensible thing to do and what it might be used for. 1 Introduction In this paper we show, by a series of examples, how the chart formalism (as given in [9]) can be translated into Z. We also discuss why this is a useful and interesting thing to do and give some examples of work that might be done in the future in this area which combines Z and charts. It might seem obvious that we should simply express the denotational semantics given in [9] directly in Z and then do our proofs. After all, the semantics is given in set theory and so Z would be adequate for the task. However, our aim is to produce versions of charts that are recognisably Z models, i.e. using the usual state and operation schema constructs and some schema calculus in natural wayschart states and transitions appear as Z state and operation schemas respectively...