Building a refinement checker for Z

John Derrick
Siobhán North
Anthony J.H. Simons

In previous work we have described how refinements can be checked using a temporal logic based model-checker, and how we have built a model-checker for Z by providing a translation of Z into the SAL input language. In this paper we draw these two strands of work together and discuss how we have implemented refinement checking in our Z2SAL toolset.

The net effect of this work is that the SAL toolset can be used to check refinements between Z specifications supplied as input files written in the LaTeX mark-up. Two examples are used to illustrate the approach and compare it with a manual translation and refinement check.

In John Derrick, Eerke Boiten and Steve Reeves: Proceedings 15th International Refinement Workshop (Refine 2011), Limerick, Ireland, 20th June 2011, Electronic Proceedings in Theoretical Computer Science 55, pp. 37–52.
Published: 17th June 2011.

ArXived at: https://dx.doi.org/10.4204/EPTCS.55.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org