Abstract
We extend B’s GSL by introducing new operators for angelic choice, thus widening its application from its original domain of conjunctive computations to that of monotonic ones in general. We explore the impact of this on our theory of substitutions [6], discovering two dual new normal forms for our new substitutions which we exploit to formulate two new first-order tests of refinement between them.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abrial, J.-R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)
Back, R.-J., von Wright, J.: Refinement Calculus: A Systematic Introduction. Springer, New York (1998)
Back, R.J.R., von Wright, J.: Combining angels, demons and miracles in program specifications. Theoretical Computer Science 100, 365–383 (1992)
Cavalcanti, A., Woodcock, J.C.P., Dunne, S.E.: Angelic nondeterminism in the unifying theories of programming. Formal Aspects of Computing 18(3), 288–307 (2006)
Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, Berlin (1990)
Dunne, S.E.: A theory of generalised substitutions. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) ZB 2002: Formal Specification and Development in Z and B. LNCS, vol. 2272, pp. 270–290. Springer, Heidelberg (2002)
Gardiner, P.H.B., Morgan, C.C.: Data refinement of predicate transformers. Theoretical Computer Science 87, 143–162 (1991)
Gardiner, P.H.B., Morgan, C.C.: A single complete rule for data refinement. Formal Aspects of Computing 5, 367–382 (1993)
Hehner, E.C.R.: Bunch theory: a simple set theory for computer science. Information Processing Letters 12(1), 26–30 (1981)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)
Jagaeesan, R., Shanbhogue, V., Saraswat, V.: Angelic nondeterminism in concurrent constraint programming, Xerox technical report (1991)
Jones, C.B.: Systematic Software Development Using VDM, 2nd edn. Prentice-Hall, Englewood Cliffs (1990)
Martin, A.P., Gardiner, P.H.B., Woodcock, J.C.P.: A tactical calculus. Formal Aspects of Computing 8(4), 479–489 (1996)
Martin, C.E., Curtis, S.A., Rewitzky, I.: Modelling nondeterminism. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 228–251. Springer, Heidelberg (2004)
Rewitzky, I.: Binary multirelations. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 259–274. Springer, Heidelberg (2003)
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)
Ward, N., Hayes, I.J.: Applications of angelic nondeterminism. In: Bailes, P.A. (ed.) Proc. of the 6th Australian Software Engineering Conference (ASWEC 1991), pp. 391–404. Australian Computer Society (1991)
Woodcock, J., Davies, J.: Using Z: Specification, Refinement and Proof. Prentice-Hall, Englewood Cliffs (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dunne, S. (2006). Chorus Angelorum. In: Julliand, J., Kouchnarenko, O. (eds) B 2007: Formal Specification and Development in B. B 2007. Lecture Notes in Computer Science, vol 4355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11955757_5
Download citation
DOI: https://doi.org/10.1007/11955757_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68760-3
Online ISBN: 978-3-540-68761-0
eBook Packages: Computer ScienceComputer Science (R0)