Skip to main content
SpringerLink
Log in

A sound and complete proof system for partial program correctness

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 74))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R., A sound and complete Hoare-like system for a fragment of PASCAL. Report IW 97/78, Mathematisch Centrum (1978).

    Google Scholar 

  2. Apt, K.R., Ten years of Hoare's logic, a survey. Proc. 5th Scandinavian Logic Symposium, Aalborg University Press, to appear.

    Google Scholar 

  3. Apt, K.R. & J.W. de Bakker, Exercises in denotational semantics. Proc 5th Symp. Math. Foundations of Computer Science (A. Mazurkiewicz, ed.), pp. 1–11, Lecture Notes in Computer Science 45, Springer (1976).

    Google Scholar 

  4. Apt, K.R. & J.W. de Bakker, Semantics and proof theory of PASCAL procedures. Proc. 4th Coll. Automata, Languages and Programming (A. Salomaa & M. Steinby, eds.), pp. 30–44, Lecture Notes in Computer Science 52, Springer (1977).

    Google Scholar 

  5. De Bakker, J.W., Correctness proofs for assignment statements. Report IW 55/76, Mathematisch Centrum (1976).

    Google Scholar 

  6. Cartwright, R & D. Oppen, Unrestricted procedure calls in Hoare's logic.Proc. 5th Symp. Principles of Programming Languages, pp. 131–140 (1978).

    Google Scholar 

  7. Clarke, E.M., Programming language constructs for which it is impossible to obtain good Hoare-like axioms. Journal ACM, vol. 26, pp. 129–147 (1979).

    Article  Google Scholar 

  8. Cook, S.A., Soundness and completeness of an axiom system for program verification. SIAM J. on Computing, vol. 7, pp. 70–90 (1978).

    Article  Google Scholar 

  9. Gorelick, G.A., A complete axiomatic system for proving assertions about recursive and non-recursive programs. Technical Report no. 75, Department of Computer Science, University of Toronto (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Centre, 2e Boerhaavestraat 49, Amsterdam

    J. W. de Bakker

Authors
  1. J. W. de Bakker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Bakker, J.W. (1979). A sound and complete proof system for partial program correctness. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation