Properties of Z specifications
ACM SIGSOFT Software Engineering Notes
The Z notation: a reference manual
The Z notation: a reference manual
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Refinement in Z and object-Z: foundations and advanced applications
Refinement in Z and object-Z: foundations and advanced applications
Z: An Introduction to Formal Methods
Z: An Introduction to Formal Methods
An Introduction to Formal Specification and Z
An Introduction to Formal Specification and Z
Software Development with Z: A Practical Approach to Formal Methods in Software Engineering
Software Development with Z: A Practical Approach to Formal Methods in Software Engineering
Specification Case Studies
How Firing Conditions Help Inheritance
ZUM '95 Proceedings of the 9th International Conference of Z Usres on The Z Formal Specification Notation
VDM '90 Proceedings of the Third International Symposium of VDM Europe on VDM and Z - Formal Methods in Software Development
Adding Specification Constructors to the Refinement Calculus
FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
On the Refinement and Simulation of Data Types and Processes
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Results on Formal Stepwise Design in Z
APSEC '02 Proceedings of the Ninth Asia-Pacific Software Engineering Conference
An Analysis of Operation-Refinement in an Abortive Paradigm
Electronic Notes in Theoretical Computer Science (ENTCS)
An analysis of forward simulation data refinement
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
A relational investigation of UTP designs and prescriptions
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
| Hi-index | 0.00 |
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.