Skip to main content

How Program Statements Transform Predicates

  • Conference paper
  • 35 Accesses

Part of the book series: Informatik — Fachberichte ((INFORMATIK,volume 5))

Abstract

This paper deals with relationships between conditions that hold before the initiation of a statement and on its completion. Statements are semantically defined by statement functions which map states to states. Statement functions induce predicate transformers which map state-space subsets to state-space subsets. The predicate transformers and their inverses are explicitly given for some well-known constructs including the conditional statement and the while statement. A number of examples illustrate how predicate transformers can be used.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. FLOYD, R.W., Assigning Meanings to Programs, Proc. Symp., Appl. Math. 19, American Math. Soc. (1967) 19–32.

    MathSciNet  Google Scholar 

  2. HOARE, C.A.R., An axiomatic Basis of Computer Programming, CACM, Vol. 12. No. 10 (October 1969), 576–580.

    MATH  Google Scholar 

  3. DIJKSTRA, E.W., A Simple Axiomatic Basis for Programming Language Constructs, Proc. Kon. Ned. Akad., Ser. A, 77 (or Indagationes Math., 36), 1–15 (1974).

    MathSciNet  MATH  Google Scholar 

  4. MANNA, Z. & A. PNUELI, Axiomatic Approach to Total Correctness of Programs, Report STAN-CS-73–382, Stanford University (1973).

    Google Scholar 

  5. DE BAKKER, J.W., Flow of control in the proof theory of structured programming, Proc. 16th IEEE Symp. on Foundations of Computer Science (1975).

    Google Scholar 

  6. MILLS, H.D., The New Math of Computer Programming, CACM, Vol. 18, No. 1 (January 1975), 43–48.

    MathSciNet  MATH  Google Scholar 

  7. HALMOS, P.R., Naive Set Theory, D. van Nostrand Company (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Ammeraal, L. (1976). How Program Statements Transform Predicates. In: Neuhold, E.J. (eds) GI — 6. Jahrestagung. Informatik — Fachberichte, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95289-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95289-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07912-5

  • Online ISBN: 978-3-642-95289-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics