Abstract
We compare the role of state invariants in Z and other state- based formalisms with that of abstract machine invariants in B.We argue a case for bringing B into line with the other formalisms in its use of in-472-489 variants, and show how this can be achieved by one small extension to B’s underlying semantics concerning the multiple composition operator, which has in any case already been proposed by others from different motivations. We illustrate the utility of our proposal with a small specification example, our Electronic Thesaurus.
Chapter PDF
Similar content being viewed by others
References
J.-R. Abrial. The B-Book: Assigning Programs to Meanings. Cambridge University Press, 1996.
R.J.R. Back and M.J. Butler. Exploring summation and product operators in the renement calculus. In B. Moller, editor, Mathematics of Program Construction,number 947 in Lecture Notes in Computer Science, pages 128–158. Springer Verlag, 1995.
R.J.R. Back and M.J. Butler. Fusion and simultaneous execution in the renement calculus. Acta Informatica, 35(11):921–940, 1998.
D. Bert, M.-L. Potet, and Y. Rouzaud. A study on components and assembly primitives in B. In H. Habrias, editor, Proceedings of the First B Conference, pages 47–62. IRIN, Nantes, 1996.
P Chartier. Formalisation of B in Isabelle/HOL. In D. Bert, editor, B’98: Recent Advances in the Development and Use of the B Method; Proceedings of the Second International B Conference, Montpellier, France, number 1393 in Lecture Notes in Computer Science, pages66–82. Springer Verlag, 1998.
C.B. Jones. Systematic Software Development Using VDM (2nd edn). Prentice-Hall, 1990.
C. Morgan. Programming from Specifications (2nd edn). Prentice Hall Interna-tional, 1994.
J.M. Spivey. The Z Notation: a Reference Manual (2nd edn). Prentice Hall Inter-national, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dunne, S. (1999). The Safe Machine: A New Specification Construct for B. In: Wing, J.M., Woodcock, J., Davies, J. (eds) FM’99 — Formal Methods. FM 1999. Lecture Notes in Computer Science, vol 1708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48119-2_27
Download citation
DOI: https://doi.org/10.1007/3-540-48119-2_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66587-8
Online ISBN: 978-3-540-48119-5
eBook Packages: Springer Book Archive