An analysis of operation refinement in Z

In this paper we analyse and compare several notions of operation refinement for specifications in Z. In particular we show that three theories: relational completion, proof-theoretic and functional (models) are all equivalent.

[1]  Jim Woodcock,et al.  Using Z - specification, refinement, and proof , 1996, Prentice Hall international series in computer science.

[2]  Steve King.  Z and the Refinement Calculus , 1990, VDM Europe.

[3]  Martin C. Henson,et al.  Investigating Z , 2000, J. Log. Comput..

[4]  Jane Sinclair,et al.  Introduction to formal specification and Z , 1991, Prentice Hall International Series in Computer Science.

[5]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.