On relaxation rules in algorithmic logic

  • B. A. Trakhtenbrot
Part of the Lecture Notes in Computer Science book series (LNCS, volume 74)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 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. 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. 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. 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. 6.
    Б.А.Трахтенброт, "О полноте алгоритмической логики", Кибернетика, No 2, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • B. A. Trakhtenbrot
    • 1
  1. 1.Institute of Mathematics, Siberian Branchthe USSR Academy of SciencesNovosibirskUSSR

Personalised recommendations