Skip to main content
SpringerLink
Log in

Multilevel structured program designs and correctness proving

  • Software-Hardware Systems
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A mathematical model of a program specification and design language is considered. A system of axioms is proposed for proving formulas interpreted as assertions of logical consistency of specifications. The results provide a mathematical foundation for the development of MSPD tools.

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. C. A. R. Hoare, "Mathematics of programming," Byte (Aug. 1986).

  2. C. A. R. Hoare and I. J. Hayes, "Laws of programming," Comm. ACM,30, No. 8, 3–7 (1987).

    Google Scholar 

  3. P. F. Gibbins, "What are formal methods," Inform. Software Technol.,30, No. 3, 12–17 (1988).

    Google Scholar 

  4. D. Bjorner and C. B. Jones, "The Vienna development method: the meta-language," Lect. Notes Comput. Sci.,61, 22–26 (1978).

    Google Scholar 

  5. E. V. Dijkstra, "A constructive approach to the problem of program correctness," BIT,8, 174–186 (1968).

    Google Scholar 

  6. S. Alagich and M. Arbib, Correct Structured Program Design [Russian translation], Radio i Svyaz’, Moscow (1984).

    Google Scholar 

  7. D. Andrews, "Data verification and program decomposition," Lect. Notes. Comput. Sci.,252, 389–422 (1987).

    Google Scholar 

  8. S. Prehn, "From VDM to RAISE," Lect. Notes. Comput. Sci.,252, 141–150 (1987).

    Google Scholar 

  9. C. A. R. Hoare, Data Structures, Current Trends in Programming Methodology, Vol. 4, Prentice-Hall, Englewood Cliffs, NJ (1978).

    Google Scholar 

  10. O. J. Dahl, E. W. Dijkstra, and C. A. R. Hoare, Structured Programming, Academic Press, New York (1972).

    Google Scholar 

  11. G. E. Tseitlin, "Design of sequential sorting algorithms: classification, transformation, generation," Programmirovanie, No. 3, 3–24 (1989).

    Google Scholar 

  12. V. M. Glushkov, "Automata theory and formal transformation of programs," Kibernetika, No. 5, 1–10 (1965).

    Google Scholar 

  13. G. E. Tseitlin, "Algorithmic algebras of data structures and multilevel program design," Programmirovanie, No. 3, 8–16 (1986).

    Google Scholar 

  14. V. P. Gritsai, "On implementation of the structured programming support system MUL'TIPROTSESSIST," Kibernetika, No. 3 (1983).

  15. V. S. Kostyrko and A. V. Bakulin, "On inductive generation of inductive assertions and program functions," Kibernetika, No. 3, 8–16 (1986).

    Google Scholar 

  16. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, "Multilevel structured program design: formalization of the method, application sphere," Kibernetika, No. 4, 42–65 (1986).

    Google Scholar 

Download references

Authors
  1. G. E. Tseitlin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Bakulin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 98–107, September–October, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseitlin, G.E., Bakulin, A.V. Multilevel structured program designs and correctness proving. Cybern Syst Anal 27, 719–726 (1991). https://doi.org/10.1007/BF01130543

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation