Skip to main content
SpringerLink
Log in

Virtual transformations of data structures

  • Published:
Cybernetics Aims and scope

Conclusion

The initial push to this research is probably due to Dahl and Hoare's Hierarchical Program Structures [6] which deeply influenced the author at the time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature Cited

  1. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass. (1969).

    Google Scholar 

  2. O. Ore, Theory of Graphs, American Mathematical Society, Providence, RI (1962).

    Google Scholar 

  3. V. K. Evtimov, “Formal methods of verification and realization of algorithms on structured storage,” Author's Abstract of Candidate's Dissertation, Kiev (1976).

  4. F. E. Allen and J. Cocke, “Graph theoretic constructs for program control flow analysis,” IBM Res. Rep. RC3923 (July, 1972).

  5. V. K. Evtimov, “Bases of paths in correctness proofs,” in: Lecture Notes in Computer Science, Vol. 28, Springer-Verlag (1975).

  6. O. Dahl, E. Dijkstra, and C. Hoare, Structured Programming, Academic Press, New York (1972).

    Google Scholar 

Download references

Authors
  1. V. K. Evtimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 62–67, January–February, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Evtimov, V.K. Virtual transformations of data structures. Cybern Syst Anal 16, 68–75 (1980). https://doi.org/10.1007/BF01099363

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01099363

Keywords

Search

Navigation