Some proofs of data refinement

https://doi.org/10.1016/0020-0190(90)90157-SGet rights and content

Abstract

Three examples of data refinement—replacement of an abstract program fragment and its variables by a more concrete fragment and variables—are presented. Correctness conditions for each refinement are derived using the proof rules of Prins⧸Gries, Morris⧸Morgan⧸Gardiner, and Chen⧸Udding. The proof methods are then compared.

References (4)

  • W. Chen et al.

    Towards a calculus of data refinement,

  • C. Morgan and P.H.B. Gardiner, Data refinement by calculation, Acta Inform., to...
There are more references available in the full text version of this article.

Cited by (0)

∗

Supported by a grant from the Unisys Corporation and by the NSF and DARPA under grant ASC-88-00465.

View full text
Copyright © 1990 Published by Elsevier B.V.