Show simple item record  

dc.contributor.authorHenson, Martin C.en_US
dc.contributor.authorReeves, Steveen_US
dc.date.accessioned2008-03-19T04:58:20Z
dc.date.available2007-07-11en_US
dc.date.available2008-03-19T04:58:20Z
dc.date.issued2003-07-01en_US
dc.identifier.citationHenson, M.C. & Reeves, S. (2003). A logic for schema-based program development.Formal Aspects of Computing. 15(1), 48-83.en_US
dc.identifier.urihttps://hdl.handle.net/10289/65
dc.description.abstractWe show how a theory of specification refinement and program development can be constructed as a conservative extension of our existing logic for Z. The resulting system can be set up as a development method for a Z-like specification language, or as a generalisation of a refinement calculus (with a novel semantics). In addition to the technical development we illustrate how the theory can be used in practice.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherSpringer-Verlag London Ltden_NZ
dc.rightsThe final, definitive version of this article is available at the Formal Aspects of Computing webpage through Springerlink.en_US
dc.subjectprogram development; refinement; Zen_US
dc.titleA logic for schema-based program developmenten_US
dc.typeJournal Articleen_US
dc.identifier.doi10.1007/s00165-003-0004-7en_US
dc.relation.isPartOfFormal Aspects of Computingen_NZ
pubs.begin-page48en_NZ
pubs.editionJulyen_NZ
pubs.elements-id29449
pubs.end-page83en_NZ
pubs.issue1en_NZ
pubs.volume15en_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record