Skip to main content
SpringerLink
Log in

On the logic of programs

  • 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. D. Scott and C. Strachey, “Towards a mathematical semantics for computer languages,” Technical Monograph PRG,6, Oxford University (1971).

  2. Yu. L. Ershov, “Theory of A spaces,” Algebra Logika,12, No.4 (1973).

  3. V. M. Glushkov, “Theory of automata and formal transformations of microprograms,” Kibernetika, No. 5 (1965).

  4. C. A. R. Hoare, “An axiomatic basis for computer programming,” Commun. ACM,12, No. 10.

  5. C. A. R. Hoare, “Procedures and parameters: an axiomatic approach,” Lecture Notes in Math.,188 (1971).

  6. R. Bird, Programs and Machines, Wiley, New York (1976).

    Google Scholar 

  7. R. Milner, “Implementation and applications of Scott's logic for computable functions,” Proc. ACM Conf. on Proving Assertions about Programs, New Mexico (1972).

  8. S. Owicki, “Consistent and complete deductive systems for the verification of parallel processes,” Proc. Eighth ACM Symp. on Theory of Computing (1976).

  9. N. Suzuki, Automatic Verification of Programs with Complex Data Structure, Ph. D. Thesis, Standford University (1976).

  10. B. Liskov and S. Zilles, “Specification techniques for data abstractions,” IEEE Trans. Software Eng., SE-1, 1 (1975).

    Google Scholar 

  11. V. R. Pratt, “Semantical consideration on Floyd-Hoare logic,” Proc. Seventeenth Symp. on Found. of Computer Science (1976).

  12. D. Harel, A. R. Meyer, and V. R. Pratt, “Computability and completeness in logics of programs,” Proc. Ninth Ann. ACM Symp. on Theory of Computing, Boulder (1977).

  13. S. D. Litvinchouk and V. R. Pratt, “A proof-checker for dynamic logic,” Proc. Fifth Int. Conf. on Artif. Intel., MIT (1977).

  14. L. Banachowski, A. Kreczmar, G. Mirkowska, H. Rasiowa, and A. Salwicki, “An introduction to algorithmic logic. Metamathematical investigations in the theory of programs,” Banach Center Publications,2, (1977).

  15. D. C. Luckham and N. Suzuki, “Proof termination within a weak logic of programs,” Acta Informatica,8, No. 1 (1977).

  16. R. L. Constable, “On the theory of programming logic,” Proc. Ninth Annual ACM Symp. on Theory of Computing, Boulder (1977).

  17. R. L. Constable, “A constructive programming logic,” IFIP Congress 77, North-Holland (1977).

  18. G. E. Tseitlin, “Certain problems of the theory of structural program schemata and parallel computations,” in: Fourth All-Union Conf. on Theoretical Cybernetics [in Russian], Novosibirsk (1977).

  19. A. L. Semenov, “Certain algorithmic problems for algorithmic algebra systems,” Dokl. Akad. Nauk SSSR,239, No. 5 (1978).

  20. V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, “Theory of automata and certain problems of the synthesis of language processor structures,” Kibernetika, No. 5 (1975).

  21. M. J. Fischer and R. E. Ladner, “Propositional modal logic of programs,” Proc. Ninth Annual ACM Symp. on Theory of Computing, Boulder (1977).

  22. E. Dijkstra, A Discipline of Programming, Prentice-Hall, New York (1976).

    Google Scholar 

  23. S. Igaraschi, R. London, and D. C. Luckham, “Automatic program verification I: a logical basis and its implementation,” Acta Informatica, No. 4 (1975).

  24. K. Segerberg, “A completeness theorem in the modal logic of programs,” Not. Am.Math.Soc.,24, No. 6 (1977).

  25. M. Grabowski, “The set of all tautologies of the zero-order algorithmic logic is decidable,” Bull. Acad. Pol. Sci., Ser. Math.,20, No. 7 (1972).

  26. G. Takeuti, Proof Theory, North-Holland (1975).

  27. S. A. Cook, “Soundness and completeness of axiom system for program verification,” SIAM J. Comput.,7, No. 1 (1978).

  28. D. Harel, A. Pnueli, and J. Stavi, “A complete axiomatic system for proving deductions about recursive programs,” Proc. Ninth Ann. ACM Symp. on Theory of Computing, Boulder (1977).

  29. J. Misra, “Prospects and limitations of automatic assertion generation for loop programs,” SIAM J. Comput.,6, No. 4 (1977).

  30. Yu. I. Yanov, “On computations in a class of programs,” in: Problems of Cybernetics [in Russian], No. 32, Fizmatgiz, Moscow (1977).

    Google Scholar 

  31. S. Gerhart, “Proof theory of partial correctness verification systems,” SIAM J. Comput.,5, No. 3 (1976).

Download references

Authors
  1. R. A. Plyushkyavichyus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Yu. Plyushkyavichene
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu. V. Sakalauskaite
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. S. P. Yukna
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 12–19, March–April, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Plyushkyavichyus, R.A., Plyushkyavichene, A.Y., Sakalauskaite, Y.V. et al. On the logic of programs. Cybern Syst Anal 15, 167–176 (1979). https://doi.org/10.1007/BF01069326

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation