Skip to main content
SpringerLink
Log in

On relaxation rules in algorithmic logic

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1979 (MFCS 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 74))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.A.R.Hoare, Procedures and parameters: An axiomatic approach, Lecture Notes in Mathematics, v. 188, Symposium on Semantics of Algorithmic Languages, 1971, 102–116.

    Google Scholar 

  2. D.Harel, A.Pnueli, J.Stavi, A Complete Axiomatic System for Proving Deductions about Recursive Programs. Proceedings 9-th ACM Symp. Theory of Computing, 249–260, 1977.

    Google Scholar 

  3. J.Guttag, J.Horning, R.London, A Proof Rule for Euclid Procedures. Proceedings of the IFIP-Conference on Formal Description of Programming Concepts, North-Holland 1978, 211–220.

    Google Scholar 

  4. K.R. Apt, L.G.L.T. Meertens, Completeness with finite systems of intermediate assertions for recursive schemes. Preprint IW 84/77. Stichting Mathematisch Centrum, Amsterdam, 1977.

    Google Scholar 

  5. R.Cartwright, D.Oppen, Unrestricted Procedure Calls in Hoare's Logics, Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978, 131–140.

    Google Scholar 

  6. Б.А.Трахтенброт, "О полноте алгоритмической логики", Кибернетика, No 2, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Siberian Branch, the USSR Academy of Sciences, 630090, Novosibirsk, USSR

    B. A. Trakhtenbrot

Authors
  1. B. A. Trakhtenbrot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trakhtenbrot, B.A. (1979). On relaxation rules in algorithmic logic. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation