Operation Refinement and Monotonicity in the Schema Calculus

Simple item page
dc.contributor.authorDeutsch, Moshe
dc.contributor.authorHenson, Martin C.
dc.contributor.authorReeves, Steve
dc.coverage.spatialConference held at Finlanden_NZ
dc.date.accessioned2008-12-04T21:15:35Z
dc.date.available2008-12-04T21:15:35Z
dc.date.issued2003
dc.description.abstractThe 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.en_US
dc.identifier.citationDeutsch, 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.en_US
dc.identifier.doi10.1007/3-540-44880-2_9en_US
dc.identifier.urihttps://hdl.handle.net/10289/1529
dc.language.isoen
dc.publisherSpringer, Berlinen_US
dc.relation.isPartOfFormal Specification and Development in Z and B: Third International Conference of B and Z Usersen_NZ
dc.relation.urihttp://www.springerlink.com/content/vgdj13rj41p8n370/en_US
dc.sourceZB 2003en_NZ
dc.subjectcomputer scienceen_US
dc.subjectZen_US
dc.titleOperation Refinement and Monotonicity in the Schema Calculusen_US
dc.typeConference Contributionen_US
dspace.entity.typePublication
pubs.begin-page103en_NZ
pubs.end-page126en_NZ
pubs.finish-date2003-06-06en_NZ
pubs.start-date2003-06-04en_NZ
pubs.volumeLNCS 2651en_NZ

Files

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Computing and Mathematical Sciences Papers