Institutional Repository

The refinement calculus

Show simple item record

dc.contributor.author Morgan, C
dc.date.accessioned 2018-05-30T13:02:34Z
dc.date.available 2018-05-30T13:02:34Z
dc.date.issued 1995
dc.identifier.citation Morgan C (1995) The refinement calculus. South African Computer Journal, Number 13, 1995 en
dc.identifier.issn 2313-7835
dc.identifier.uri http://hdl.handle.net/10500/24169
dc.description.abstract The refinement calculus, based on weakest preconditions, elaborates imperative program developments as a series of steps linked by a mathematical refinement relation. Specifications and executable code are regarded equally as programs, allowing a gradual transformation from one to the other. The extra generality afforded by admitting specifications as code allows a uniform treatment of procedures, parameters, recursion, data refinement, typing and miracles. en
dc.language.iso en en
dc.publisher South African Computer Society (SAICSIT) en
dc.subject Refinement en
dc.subject Weakest preconditions en
dc.subject Program development en
dc.subject Specifications en
dc.subject Data refinement en
dc.subject Miracles en
dc.title The refinement calculus en
dc.type Article en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UnisaIR


Browse

My Account

Statistics