Advertisement

A calculus for proving properties of while-programs

  • Ingrid Glasner
  • Jacques Loeckx
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 75)

Keywords

Inference Rule Operational Semantic Program Variable Nest Depth Syntactical Class 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E.A. Ashcroft, W.W. Wadge, "LUCID, a formal system for writing and proving programs", SIAM Journal Comp. 5, 3 (1976)Google Scholar
  2. [2]
    E.W. Dijkstra, "A discipline of programming", Prentice Hall, 1976Google Scholar
  3. [3]
    I. Glasner, "Formale Beweise über while-Programme: Ein Kalkül und sein Modell", Diplomarbeit, Universität des Saarlandes, Saarbrücken, 1978Google Scholar
  4. [4]
    C.A.R. Hoare, "An axiomatic basis of computer programming", Comm. ACM 12, 10 (1969)Google Scholar
  5. [5]
    S. Lehmann, J. Loeckx, "An algorithm normalizing elementary while-programs", Bericht A 76/14, Fachbereich 10, Universität des Saarlandes, Saarbrücken (1976).Google Scholar
  6. [6]
    Z. Manna, "Mathematical theory of computation", McGraw-Hill, 1974Google Scholar
  7. [7]
    Z. Manna, A. Pnueli, "Axiomatic approach to total correctness of programs", Acta Informatica 3, 3 (1974)Google Scholar
  8. [8]
    R. Milner, "Implementation and application of Scott's logic for computable functions", SIGPLAN Notices 7,1 (1972)Google Scholar
  9. [9]
    J.H. Morris, B. Wegbreit, "Subgoal induction", Comm. ACM 20, 4 (1977).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Ingrid Glasner
    • 1
  • Jacques Loeckx
    • 1
  1. 1.Fachbereich 10 der Universität des SaarlandesSaarbrückenFRG

Personalised recommendations