Elsevier

Information Processing Letters

Volume 29, Issue 6, 8 December 1988, Pages 293-296
Information Processing Letters

Auxiliary variables in data refinement

https://doi.org/10.1016/0020-0190(88)90227-XGet rights and content

Abstract

A set of local variables in a program is auxiliary if its members occur only in assignments to members of the same set. Data refinement transforms a program, replacing one set of local variables by another set, in order to move towards a more efficient representation of data. Most techniques of data refinement give a direct transformation. But there is an indirect technique, using auxiliary variables, that proceeds in several stages. Usually, the two techniques are considered separately. It is shown that the several stages of the indirect technique are themselves special cases of the direct one, thus unifying the separate approaches. Removal of auxiliary variables is formalised incidentally.

References (9)

  • E.W. Dijkstra

    A Discipline of Programming

    (1976)
  • P.H.B. Gardiner and C.C. Morgan, Data refinement of predicate transformers, Theoret. Comput. Sci., Submitted for...
  • D. Gries et al.

    A new notation of encapsulation

    Proc. SIGPLAN Symp. on Language Issues in Programming Environments

    (June 1985)
  • C.A.R. Hoare

    Proof of correctness of data representations

    Acta Informatica

    (1972)
There are more references available in the full text version of this article.

Cited by (0)

View full text