Advertisement

Acta Informatica

, Volume 6, Issue 1, pp 61–75 | Cite as

Axiomatics for memory allocation

  • A. P. Ershov
Article

Summary

In the paper a method of labelling is applied to constructing a correct and complete transformation system which allows one, for any program scheme, to construct systematically any permissible memory allocation for variables of the scheme. Permissible memory allocations are assumed to be such allocations that preserve all information flow connections from the initial scheme.

Keywords

Information System Operating System Data Structure Communication Network Information Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notations

B

set of internal statements (2.3)

D

information flow graph (2.2)

Dj

component of an information flow graph (2.2)

E

set of statements reachable downwards arcs (2.3)

G

skeleton (2.1)

i

input

L

set of statements reachable upwards arcs (2.3)

N

information carrier (2.1)

o

output (2.1)

(o, i)

information pair (2.1)

p

pole (2.1)

R

memory allocation (2.1)

L

Lavrov scheme (2.1)

T, U

statements (2.1)

V

poles allocation (2.1)

W

inconsistency graph (2.3)

X

memory (2.1)

x, y

variables (2.1)

φ

empty set

calculability relation (2.1)

equivalence relation (3.1)

transformability relation (3.1)

end of a theorem proof

ɛ

empty word

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Yanov, Yu. I.: On logical algorithms schemata. Cybernetics Problems 1, Fizmatgiz, Moscow (1961)Google Scholar
  2. 2.
    Ershov, A. P.: Operator algorithms. III (On operator Yanov schemata). Cybernetics Problems 20, Nauka, Moscow (1967)Google Scholar
  3. 3.
    Lavrov, S. S.: On memory economy in closed program schemata. USSR Computational Mathematics and Mathematical Physics 1, no. 4 (1961)Google Scholar
  4. 4.
    Ershov, A. P.: Reduction of the problem of the memory economy during program writing to the problem of colouring graph verticles. Doklady Akademii Nauk SSSR 142, no. 4 (1962)Google Scholar

Copyright information

© Springer-Verlag 1976

Authors and Affiliations

  • A. P. Ershov
    • 1
  1. 1.Computing CenterNovosibirskUSSR

Personalised recommendations