Z: A Formal Specification Notation
Z (pronounced ‘zed’) is a formal specification notation  based on set theory and first order predicate logic. The mathematical notation is supported by a library of operators known as the ‘Z toolkit’, which is largely formally defined within the Z notation itself . The operators have a large number of algebraic laws which aid in the reasoning about Z specification. As well as the mathematical notation, there is a ‘schema’ notation to aid in the structuring of the mathematics for large specification by packaging the mathematical notation into boxes that may be used and combined subsequently.
KeywordsMathematical Notation Abstract State State Component Error Report Total Operation
Unable to display preview. Download preview PDF.
- 1.Bowen J.P. (1996) Formal Specification and Documentation Using Z: A Case Study Approach. International Thomson Computer Press, LondonGoogle Scholar
- 2.Bowen J.P., Hinchey M.G. (1997) Formal models and the specification process. In: Tucker, Jr. A.B. (Ed.) The Computer Science and Engineering Handbook. CRC Press, chapter 107, 2302–2322.Google Scholar
- 3.Bowen J.P., Hinchey M.G. (1999) High-Integrity System Specification and Design. Formal Approaches to Computing and Information Technology series (FACIT). Springer-Verlag, LondonGoogle Scholar
- 4.Hayes I.J. (Ed.) (1993) Specification Case Studies 2nd edition. Prentice Hall International Series in Computer Science, LondonGoogle Scholar
- 5.Jacky J. (1997) The Way of Z: Practical Programming with Formal Methods. Cambridge University Press, CambridgeGoogle Scholar
- 8.Spivey J.M. (1992) The Z Notation: A Reference Manual, 2nd edition. Prentice Hall International Series in Computer Science, LondonGoogle Scholar
- 9.Wing J.M. (1990) A specifier’s introduction to formal methods. IEEE Computer, 23(9):8–24. Also in , 167–199Google Scholar
- 10.Woodcock J.C.P., Davies J. (1996) Using Z: Specification, Proof and Refinement. Prentice Hall International Series in Computer Science, LondonGoogle Scholar