A sound and relatively complete axiomatization of clarke's language L4: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 164 LNCS, Issue , 1984, Pages 161-175

  Damm, Werner ^a   Josko, Bernhard ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034578372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-12896-4_362     Document Type: Conference Paper

References (25)

1. Goguen, J. A., Thatcher, J. W., Wagner, E. G., Wright, J. B.: Initial algebra semantics and continuous algebras. J. ACM 24, 68-95 (1977).
2. Apt, K. R.: Ten years of Hoare’s logic: a survey-part I. ACM toplas 3, 431-483 (1981).
3. 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).
4. Barendregt, H. P.: The type free lambda calculus. Handbook of Mathematical Logic, North-Holland (1977).
5. Clarke, E. M,: Programming language constructs for which it is impossible to obtain good Hoare-like axioms. JACM 26, 129-147 (1979).
6. Clarke, E. M., German, S. M., Halpern, J. Y.: On effective automatizations of Hoare-logics. 9th Anual ACM Symposium on Principles of Programming Languages, 309-321 (1982).
7. Cook, S. A.: Soundness and completeness of an axiom system for program verification. SIAM J. comput. 7, 70-90 (1978).
8. Dam, W.: The 10 - and 01 - hierarchies. TCS 20, 95-207 (1982).
9. Damm, W., Fehr, E.,: A schematologieal approach to the analysis of the procedure concept in ALGOL-languages. Proc. 5eme Colloque sur les Arbres en Algebre et en Progranimation, Lille, 130-134 (1980).
10. Damm, w., Josko, B.: A sound and relatively complete Boare logic for a language with higher type procedures Schriften zur Informatik und Angewandten Mathematik Nr. 77 TH Aachen (1982) (to appear in Acta Informatica).
11. 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).
12. 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).
13. Hoare, C. A. R.: An axiomatic basis for computer programming. Comm, aem 12 576-583 (1969).
14. Josko, B.: On expressive interpretations of a Eoare-logic for a language with higher type procedures, Schriften zur Informatik und Angewandten Mathematik, Nr. 88, TH Aachen (1983).
15. Josko, B.: A Hoare-calculus for ALGOL-like programs with finite mode proce dures without global variables, Aachen (1983).
16. Langmaack, H.: On procedures as open subroutines I3 II Acta informatica 2, 311-333 (1973) and 3, 227-241 (1974).
17. 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).
18. Langmaack, H.: On termination problem for finitely interpreted ALGOL-like programs. Acta Informatica 18, 79-108 (1982).
19. Langmaack, B.: Aspects of Programs with Finite Modes, Proc. of the inter national Conference on Foundations of Computation Theory 1983.
20. 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).
21. 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).
22. olderog, E. -R.: Sound and complete Hoare-tike calculi based on copy rules. Acta Informatica 16, 161-197 (1981).
23. Olderog, E. R.: Hoare-style proof and formal computations. gi-11. Jahres- tagung, IFB 50, 65-71 (1981).
24. Olderog, E. -R.: Correctness of programs with PASCAL-like procedures with out global variables. (to appear in TCS).
25. Trakthenbrot, B. A., Halpern, J. Y., Meyer, A. R.: From denotational to copy- rule to axiomatic semantics Proc. Workshop on Logics of Programs, Pittsburgh (1983).