Preview
Unable to display preview. Download preview PDF.
References
Goguen, J.A./Thatcher, J.W./Wagner, E.G./Wright, J.B.: Initial algebra semantics and continuous algebras. J.ACM 24, 68–95 (1977)
Apt, K.R.: Ten years of Hoare's logic: a survey-part I. ACM TOPLAS 3, 431–483 (1981)
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)
Barendregt, H.P.: The type free lambda calculus. Handbook of Mathematical Logic, North-Holland (1977)
Clarke, E.M.: Programming language constructs for which it is impossible to obtain good Hoare-like axioms. JACM 26, 129–147 (1979)
Clarke, E.M.,/German, S.M./Halpern, J.Y.: On effective axiomatizations of Hoare-logics. 9th Anual ACM Symposium on Principles of Programming Languages, 309–321 (1982)
Cook, S. A.: Soundness and completeness of an axiom system for program verification. SIAM J. Comput. 7, 70–90 (1978)
Damm, W.: The IO — and OI — hierarchies. TCS 20, 95–207 (1982)
Damm, W./Fehr, E.: A schematological approach to the analysis of the procedure concept in ALGOL-languages. Proc. 5ème Colloque sur les Arbres en Algèbre et en Programmation, Lille, 130–134 (1980)
Damm, W./Josko, B.: A sound and relatively* complete Hoare logic for a language with higher type procedures Schriften zur Informatik und Angewandten Mathematik Nr. 77 TH Aachen (1982) (to appear in Acta Informatica)
German, S.M./Clarke, E.M./Halpern, J.Y.: A stronger axiom system for reasoning about procedures as parameters. Proc. Workshop on Logics of Programs, Pittsburgh (1983)
Gorelick, G.A.: A complete axiomatic system for proving assertions about recursive and non-recursive programs. Techn. Rep. 75, Dept. of Computer Sci., Univ. of Toronto (1975)
Hoare, C.A. R.: An axiomatic basis for computer programming. Comm. ACM 12 576–583 (1969)
Josko, B.: On expressive interpretations of a Hoare-logic for a language with higher type procedures, Schriften zur Informatik und Angewandten Mathematik, Nr. 88,TH Aachen (1983)
Josko, B.: A Hoare-calculus for ALGOL-like programs with finite mode procedures without global variables, Aachen (1983)
Langmaack, H.: On procedures as open subroutines I, II Acta Informatica 2, 311–333 (1973) and 3, 227–241 (1974)
Langmaack, H.: On a theory of decision problems in programing languages. Proc. Int. Conf. on Mathematical Studies of Information Processing, LNCS 75, 538–558 (1979)
Langmaack, H.: On termination problem for finitely interpreted ALGOL-like programs. Acta Informatica 18, 79–108 (1982)
Langmaack, H.: Aspects of Programs with Finite Modes, Proc. of the International Conference on Foundations of Computation Theory 1983
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)
Lipton, R.J.: A nexessary and sufficient condition for the existence of Hoare logics. 18th IEEE Symp. on Foundations of Computer Science, 1–6 (1977)
Olderog, E.-R.: Sound and complete Hoare-like calculi based on copy rules. Acta Informatica 16, 161–197 (1981)
Olderog, E.R.: Hoare-style proof and formal computations. GI-11. Jahrestagung, IFB 50, 65–71 (1981)
Olderog, E.-R.: Correctness of programs with PASCAL-like procedures without global variables. (to appear in TCS)
Trakthenbrot, B.A./Halpern, J.Y./Meyer, A.R.: From denotational to copyrule to axiomatic semantics Proc. Workshop on Logics of Programs, Pittsburgh (1983).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damm, W., Josko, B. (1984). A sound and relatively complete axiomatization of clarke's language L4 . In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_362
Download citation
DOI: https://doi.org/10.1007/3-540-12896-4_362
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12896-0
Online ISBN: 978-3-540-38775-6
eBook Packages: Springer Book Archive