Skip to main content
SpringerLink
Log in

A sharp proof rule for procedures in wp semantics

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A proof rule for the procedure call is proposed that has the property that the precondition it defines is the weakest precondition that can be inferred solely from the procedure's specification. Thus the rule enforces exactly the abstraction introduced by the specification. Gries's proof rule for the procedure call is shown not to have this property in cases when the specification involves so-called specification variables.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bijlsma, A., Wiltink, J.G., Matthews, P.A.: Equivalence of the Gries and Martin Proof Rules for Procedure Calls. Acta Inf. 23, 357–360 (1986)

    Google Scholar 

  2. Dijkstra, E.W.: A Discipline of Programming. Englewood Cliffs, New Jersey: Prentice Hall 1976

    Google Scholar 

  3. Gries, D.: The Science of Programming. New York: Springer 1981

    Google Scholar 

  4. Gries, D., Levin, G.: Assignment and Procedure Call Proof Rules. ACM Trans. Progr. Lang. Syst. 2, 564–579 (1980)

    Google Scholar 

  5. Hemerik, C.: Formal Definitions of Programming Languages as a Basis for Compiler Construction. Thesis, Eindhoven 1984

  6. Martin, A.J.: A General Proof Rule for Procedures in Predicate Transformer Semantics. Acta Inf. 20, 301–313 (1983)

    Google Scholar 

  7. Olderog, E.-R.: On the Notion of Expressiveness and the Rule of Adaptation. Theor. Comput. Sci. 24, 337–347 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, ETH, P.O. Box 513, NL-5600, MB Eindhoven, The Netherlands

    A. Bijlsma

  2. Department of Computer Science, Aarhus University, Ny Munkegade, DK-8000, Aarhus, Denmark

    P. A. Matthews

  3. Hildebrandhove 107, NL-2726, AT Zoetermeer, The Netherlands

    J. G. Wiltink

Authors
  1. A. Bijlsma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. A. Matthews
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. G. Wiltink
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bijlsma, A., Matthews, P.A. & Wiltink, J.G. A sharp proof rule for procedures in wp semantics. Acta Informatica 26, 409–419 (1989). https://doi.org/10.1007/BF00289144

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289144

Keywords

Search

Navigation