A logic for schema-based program development
| dc.contributor.author | Henson, Martin C. | en_US |
| dc.contributor.author | Reeves, Steve | en_US |
| dc.date.accessioned | 2008-03-19T04:58:20Z | |
| dc.date.available | 2007-07-11 | en_US |
| dc.date.available | 2008-03-19T04:58:20Z | |
| dc.date.issued | 2003-07-01 | en_US |
| dc.description.abstract | We 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.mimetype | application/pdf | |
| dc.identifier.citation | Henson, M.C. & Reeves, S. (2003). A logic for schema-based program development.Formal Aspects of Computing. 15(1), 48-83. | en_US |
| dc.identifier.doi | 10.1007/s00165-003-0004-7 | en_US |
| dc.identifier.uri | https://hdl.handle.net/10289/65 | |
| dc.language.iso | en | |
| dc.publisher | Springer-Verlag London Ltd | en_NZ |
| dc.relation.isPartOf | Formal Aspects of Computing | en_NZ |
| dc.rights | The final, definitive version of this article is available at the Formal Aspects of Computing webpage through Springerlink. | en_US |
| dc.subject | program development; refinement; Z | en_US |
| dc.title | A logic for schema-based program development | en_US |
| dc.type | Journal Article | en_US |
| dspace.entity.type | Publication | |
| pubs.begin-page | 48 | en_NZ |
| pubs.edition | July | en_NZ |
| pubs.end-page | 83 | en_NZ |
| pubs.issue | 1 | en_NZ |
| pubs.volume | 15 | en_NZ |
Files
Original bundle
1 - 1 of 1