Publication: Operation Refinement and Monotonicity in the Schema Calculus
Loading...
Permanent Link
Publisher link
Rights
Abstract
The schema calculus of Z provides a means for expressing structured, modular specifications. Extending this modularity to program development requires the monotonicity of these operators with respect to refinement. This paper provides a thorough mathematical analysis of monotonicity with respect to four schema operations for three notions of operation refinement. The mathematical connection between the equational schema logic and monotonicity is discussed and evaluated.
Citation
Deutsch, M., Henson, M.C. & Reeves, S. (2003). Operation Refinement and Monotonicity in the Schema Calculus. In D. Bert et al.(Eds.), Proceedings of the Third International Conference of B and Z Users Turku, Finland, June 4–6, 2003(pp. 639). Berlin: Springer.
Series name
Date
Publisher
Springer, Berlin