Formale Korrektheitsbeweise für While-Programme

  • J. Loeckx
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)


Wenn Gilt 
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. [1]
    S. Igarashi, R.L. London, D.C. Luckham, "Automatic program verification", Acta Informatica 4, 2 (1975)CrossRefGoogle Scholar
  2. [2]
    R. Milner, "Implementation and applications of Scott's Logic for Computable Functions", Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices 7, 1 (1972)Google Scholar
  3. [3]
    C.A.R. Hoare, N. Wirth, "An axiomatic definition of the programming language PASCAL", Acta Informatica 2, 4 (1973)CrossRefGoogle Scholar
  4. [4]
    L. Aiello, M. Aiello, R. Weyrauch, "The semantics of PASCAL in LCF", Artif. Intell. Memo 221, Stanford Univ. (1974)Google Scholar
  5. [5]
    E.A. Ashcroft, W.W. Wadge, "LUCID, a formal system for writing and proving programs", SIAM J. Comp. 5, 3 (1976)Google Scholar
  6. [6]
    E.A. Ashcroft, W.W. Wadge, "LUCID, a non-procedural language with iteration", Comm. ACM, to appearGoogle Scholar
  7. [7]
    E.A. Ashcroft, W.W. Wadge, "Program proving without tears", Colloque de l'IRIA sur la construction, l'amélioration et la vérification de programmes, Arc-et-Senans, 1–3 juillet 1975Google Scholar
  8. [8]
    Z. Manna, "Mathematical theory of computation", McGraw-Hill, 1975Google Scholar
  9. [9]
    S. Lehmann, J. Loeckx, "An algorithm normalizing elementary while-programs", Bericht Nr. A 76/14, Fachbereich 10, Universität des Saarlandes (Saarbrücken), Dezember 1976Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • J. Loeckx

There are no affiliations available

Personalised recommendations