Abstract
This chapter presents the Z specification language, which is one of the most widely used formal methods. Z is a formal specification language based on Zermelo set theory. It was developed at the Programming Research Group at Oxford University in the early 1980s. Z specifications are mathematical and employ a classical two-valued logic. The use of mathematics ensures precision and allows inconsistencies and gaps in the specification to be identified. Theorem provers may be employed to demonstrate that the software implementation meets its specification.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Step-wise refinement involves producing a sequence of increasingly more concrete specifications until eventually the executable code is produced. Each refinement step has associated proof obligations to prove that it is valid.
- 2.
This project claimed a 9% increase in productivity attributed to the use of formal methods.
Reference
Diller A (1990) Z. An introduction to formal methods. Wiley, England
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
O’Regan, G. (2020). Z Formal Specification Language. In: Mathematics in Computing. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-34209-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-34209-8_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34208-1
Online ISBN: 978-3-030-34209-8
eBook Packages: Computer ScienceComputer Science (R0)