Skip to main content

Consistency and refinement for partial specification in Z

Boiten, Eerke Albert and Derrick, John and Bowman, Howard and Steen, Maarten (1996) Consistency and refinement for partial specification in Z. In: Gaudel, M.C. and Woodcock, Jim, eds. FME'96: Industrial Benefit and Advances in Formal Methods Third International Symposium of Formal Methods Europe Co-Sponsored by IFIP. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 287-306. ISBN 978-3-540-60973-5. E-ISBN 978-3-540-49749-3. (doi:10.1007/3-540-60973-3_93) (KAR id:21388)

Language: English
Download (372kB) Preview
Language: English
Download (186kB) Preview
Official URL


This paper discusses theoretical background for the use of Z as a language for partial specification, in particular techniques for checking consistency between viewpoint specifications. The main technique used is unification, i.e. finding a (candidate) least common refinement. The corresponding notion of consistency between specifications turns out to be different from the known notions of consistency for single Z specifications. A key role is played by correspondence relations between the data types used in the various viewpoints.

Item Type: Book section
DOI/Identification number: 10.1007/3-540-60973-3_93
Uncontrolled keywords: viewpoints; Z; consistency; State Consistency; Unification Method; State Schema; Unification Rule; Identity Relation
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Faculties > Sciences > School of Computing > Systems Architecture Group
Depositing User: Eerke Boiten
Date Deposited: 03 Sep 2009 21:03 UTC
Last Modified: 09 Feb 2020 04:03 UTC
Resource URI: (The current URI for this page, for reference purposes)
Boiten, Eerke Albert:
Bowman, Howard:
  • Depositors only (login required):


Downloads per month over past year