Results 1 
4 of
4
Towards Correct Executable Semantics For Z
 Z USER WORKSHOP, CAMBRIDGE 1994, WORKSHOPS IN COMPUTING
, 1994
"... There are many ad hoc tools aimed at the animation of executable subsets of the formal specification language Z. This paper presents an approach to rigorously establishing the correctness of such Z animation tools, drawing on ideas from the field of abstract interpretation. Enough of the standard ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
There are many ad hoc tools aimed at the animation of executable subsets of the formal specification language Z. This paper presents an approach to rigorously establishing the correctness of such Z animation tools, drawing on ideas from the field of abstract interpretation. Enough of the standard Zsyntax is treated to cover most uses of Z schemas and expressions, after schema calculus constructs have been expanded and embedded schema references replaced.
Z and HOL
, 1994
"... A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic. The HOL theorem proving system supports higher order logic. A wellknown case study is used as a running example. The presentation is i ..."
Abstract
 Add to MetaCart
A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic. The HOL theorem proving system supports higher order logic. A wellknown case study is used as a running example. The presentation is intended to show people with some knowledge of Z how a tool such as HOL can be used to provide mechanical support for the notation, including mechanization of proofs. No specialized knowledge of HOL is assumed.
Z and HOL
, 1994
"... A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic and is typically used for humanreadable formal specification. The HOL theorem proving system supports higher order logic and is used fo ..."
Abstract
 Add to MetaCart
A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic and is typically used for humanreadable formal specification. The HOL theorem proving system supports higher order logic and is used for machinechecked verification. A wellknown case study is used as a running example. The presentation is intended to show people with some knowledge of Z how a tool such as HOL can be used to provide mechanical support for the notation, including mechanization of proofs. No specialized knowledge of HOL is assumed.
Z and HOL
"... A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic and is typically used for humanreadable formal specification. The HOL ..."
Abstract
 Add to MetaCart
A simple `shallow' semantic embedding of the Z notation into the HOL logic is described. The Z notation is based on set theory and first order predicate logic and is typically used for humanreadable formal specification. The HOL