Skip to main content
SpringerLink
Log in

Problem-oriented program verification system “SPEKTR”

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. V. A. Nepomnyashchii, “Practical methods of program verification,” Kibernetika, No. 2, 21–28 (1984).

    Google Scholar 

  2. V. A. Nepomnyashchii, “Elimination of loop invariants during program verification,” Programmirovanie, No. 3, 3–13 (1985).

    Google Scholar 

  3. V. A. Nepomnyashchii, “On problem-oriented program verification,” Programmirovanie, No. 1, 3–12 (1986).

    Google Scholar 

  4. V. A. Nepomnyashchii, “Proving correctness of linear algebra programs,” Programmirovanie, No. 4, 63–72 (1982).

    Google Scholar 

  5. S. G. Vorob'ev, “On application of conditional term substitution systems for program verification,” Programmirovanie, No. 4, 3–14 (1986).

    Google Scholar 

  6. C. A. R. Hoare, “Proof of correctness of data representation,” in: Data in Programming Languages [Russian translation], Mir, Moscow (1982), pp. 54–67.

    Google Scholar 

  7. R. E. Shostak, “On the sup-inf method for proving Presburger formulas,” J. ACM,24, No. 4, 529–543 (1977).

    Google Scholar 

  8. R. E. Shostak, “A practical decision procedure for arithmetic with function symbols,” J. ACM,26, No. 2, 351–360 (1979).

    Google Scholar 

  9. G. Huet and D. C. Oppen, “Equations and rewrite rules. A survey,” Formal Language Theory: Perspectives and Open Problems, Academic Press, NY (1980), pp.349–406.

    Google Scholar 

  10. G. A. Kucherov, “Term substitution systems,” Preprint [in Russian], No. 601, VTs SO AN SSSR, Novosibirsk (1985).

    Google Scholar 

  11. S. G. Vorob'ev, “On building in decidable fragments of arithmetic for term rewriting systems,” in: Compiling and Program Design [in Russian], VTs SO AN SSSR, Novosibirsk (1986), pp. 91–97.

    Google Scholar 

  12. S. G. Vorob'ev, “Inductive definitions and proofs in conditional term rewriting systems,” in: Problems of Improving Design, Testing, Verification, and Debugging of Programs, abstracts of papers at All-Union Conf. [in Russian], Vol. 1, VTs Latv. Gos. Univ., Riga (1986), pp. 73–75.

    Google Scholar 

  13. A. N. Bezdushnyi and A. A. Sulimov, “Implementation of the basic language of a program verification system using the compiler construction system SUPER,” in: Programming Theory and Tools of Describing Parallelism of Discrete Systems [in Russian], VTs SO AN SSSR, Novosibirsk (1985), pp. 29–37.

    Google Scholar 

  14. A. A. Sulimov, “Functional specifications of a compiler,” in: Compiling and Transformation of Programs [in Russian], VTs SO AN SSSR, Novosibirsk (1984), pp. 137–150.

    Google Scholar 

  15. N. Wirth, Algorithms + Data Structures = Programs [Russian translation], Mir, Moscow (1985).

    Google Scholar 

Download references

Authors
  1. V. A. Nepomnyashchii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. G. Vorob'ev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. A. Sulimov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 31–37, November–December, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nepomnyashchii, V.A., Vorob'ev, S.G. & Sulimov, A.A. Problem-oriented program verification system “SPEKTR”. Cybern Syst Anal 23, 757–765 (1987). https://doi.org/10.1007/BF01070237

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation