Axiomatic semantics of indirect addressing

  • Juraj Steiner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)


The assignments of form EXPσ (tl, have been studied and applied to arrays and pointers.

These constructs can be modelled by various languages; two alternatives have been described for both arrays and pointers.

The conceptualizations given by languages (A1,D) (P1,P1) use the full power of the generalized assignment statement and the meaning of arrays and pointers is given "dynamically", by means of a suitable choice of the variable operators.

In case of the languages (A2,D2) and (P2,P2) we have managed with simple assignments (n=0) and the meaning of arrays and pointers is given "statically" via some assumptions on the corresponding data algebras.

The main contribution of the paper can be seen in the presented formalism enabling to compare the above-mentioned semantic views /Theorems 3.1 and 4.1/.


Assignment Statement Programming Variable Denotational Semantic Simple Substitution Operation Symbol 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dijkstra, E.W., A Discipline of Programming. Prentice-Hall, 1976.Google Scholar
  2. 2.
    ADJ /Authors: Goguen, J.A., Thatcher, J.W., Wagner, E. G., Wright, J.B./, Initial algebra semantics and continuous algebras. Journal of the ACM, 24 /1977/, 68–95.Google Scholar
  3. 3.
    Pratt,V.R., Semantical considerations on Floyd-Hoare logic. In.: Proc. 17th IEEE Symp. on Foundations of Computer Science, Houston, 1976, pp. 109–121.Google Scholar
  4. 4.
    Hoare, C.A.R., Wirth, N., An axiomatic definition of the programming language PASCAL. Acta Informatica, 2/1973/, 335–355.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Juraj Steiner
    • 1
  1. 1.Computing Research CentreBratislavaCzechoslovakia

Personalised recommendations