On expressive interpretations of a Hoare-logic for Clarke's language L4

  • Bernhard Josko
Contibuted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)


Free Variable Auxiliary Variable Computable Function Relation Symbol Computable Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BKM]
    de Bakker, J.W./Klop, J.W./Meyer, J.-J.Ch.: Correctness of programs with function procedures. Report IW 170/81, Mathematisch Centrum, Amsterdam (1981)Google Scholar
  2. [C1]
    Clarke, E.M.: Programming language constructs for which it is impossible to obtain good Hoare-like axioms. JACM 26, 129–147 (1979)Google Scholar
  3. [CGH]
    Clarke, E.M./German, S.M./Halpern, J.Y.: On effective axiomatizations of Hoare-logics. 9th Annual ACM Symp. on Principles of Programming Languages, 309–321 (1982)Google Scholar
  4. [CE]
    Constable, R./Egli, H.: Computability concepts for programming language semantics. TCS 2, 133–145 (1976)Google Scholar
  5. [DJ]
    Damm, W./Josko, B.: A sound and relatively* complete Hoare logic for a language with higher type procedures. Acta Informatica 20, 59–101 (1983)Google Scholar
  6. [GCH]
    German, S.M./Clarke, E.M./Halpern, J.Y.: A stronger axiom system for reasoning about procedures as parameters. Workshop on Logics of Programs, Pittsburgh (1983)Google Scholar
  7. [Ho]
    Hoare, C.A.R.: An axiomatic basis for computer programming. CACM 12, 576–583 (1969)Google Scholar
  8. [Jo1]
    Josko, B.: On expressive interpretations of a Hoare-logic for a language with higher type procedures. Schriften z. Inf. u. Angewandt. Math. Nr. 88, Aachen (1983)Google Scholar
  9. [Jo2]
    Josko, B.: A Hoare-calculus for ALGOL-like programs with finite mode procedures without global variables. (in preparation)Google Scholar
  10. [Jo3]
    Josko, B.: A note on expressivity definitions in Hoare-logics. Schriften z. Inf. u. Angewandt. Math. Nr. 80, TH Aachen (1982)Google Scholar
  11. [Ka]
    Kanda, A.: Effective solutions of recursive domain equations. Warwick (1979)Google Scholar
  12. [La1]
    Langmaack, H.: On procedures as open subroutines I, II. Acta Informatica 2, 311–333 (1973) and 3, 227–241 (1974)Google Scholar
  13. [La2]
    Langmaack, H.: Aspects of programs with finite modes. Proc. of the Int. Conf. on Foundations of Computation Theory (1983)Google Scholar
  14. [LO]
    Langmaack, H./Olderog, E.-R.: Present-day Hoare-like systems for programming languages with procedures: power limits and most likely extensions. Proc. 7th Coll. Automata, Languages and Programming, LNCS 85, 363–373 (1980)Google Scholar
  15. [Li]
    Lipton, R.J.: A necessary and sufficient condition for the existence of Hoarelogics. 18th IEEE Symp. on Foundations of Computer Science, 1–6 (1977)Google Scholar
  16. [Ol1]
    Olderog, E.-R.: Sound and complete Hoare-like calculi based on copy rules. Acta Informatica 16, 161–197 (1981)Google Scholar
  17. [Ol2]
    Olderog, E.-R.: Hoare-style proof and formal computations. 11. GI-Jahrestagung, IFB 50, 65–71 (1981)Google Scholar
  18. [Ol3]
    Olderog, E.-R.: Correctness of programs with PASCAL-like procedures without global variables. (to appear in TCS)Google Scholar
  19. [Ro]
    Rogers, H.: Theory of recursive functions and effective comptability. McGraw-HillGoogle Scholar
  20. [TMH]
    Trakhtenbrot, B.A./Meyer, A.E./Halpern, J.Y.: From denotational to operational and axiomatic semantics for ALGOL-like languages. Workshop on Logics of Programs, Pittsburgh (1983)Google Scholar
  21. [Ta]
    Takeuti, G.: Proof theory. North-Holland (1975)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Bernhard Josko
    • 1
  1. 1.Lehrstuhl für Informatik II, RWTH AachenAachenWest-Germany

Personalised recommendations