Skip to main content
SpringerLink
Log in

Preliminaries

  • Chapter
Verification of Sequential and Concurrent Programs

Part of the book series: Texts and Monographs in Computer Science ((MCS))

  • 83 Accesses

Abstract

In this chapter we explain the notation used throughout this book and some necessary elementary notions from mathematical logic.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.W. de Bakker. Mathematical Theory of Program Correctness. Prentice-Hall International, Englewood Cliffs, NJ, 1980.

    MATH  Google Scholar 

  2. L. Cardelli. Typeful programming In E.J. Neuhold and M. Paul, editors, State of the Art Book: Formal Description of Programming Concepts, New York, 1990. Springer-Verlag. To appear.

    Google Scholar 

  3. E.W. Dijkstra and C.S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, New York, 1990.

    Book  MATH  Google Scholar 

  4. H.B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.

    Google Scholar 

  5. Y. Girard. Proofs and Types. Cambridge University Press, Cambridge, Great Britain, 1989.

    Google Scholar 

  6. P.R. Halmos. I Want to be a Mathematician: An Automatography. Springer-Verlag, New York, 1985.

    Book  Google Scholar 

  7. P. Kandzia and H. Langmaack. Informatik: Programmierung. Teubner, Stuttgart, 1973.

    MATH  Google Scholar 

  8. E. Mendelson. Introduction to Mathematical Logic. van Nostrand, Princeton, second edition, 1979.

    Google Scholar 

  9. J.C. Mitchell. Type systems in programming languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 365–458, Amsterdam, 1990. Elsevier.

    Google Scholar 

  10. J.V. Tucker and J.I. Zucker. Program Correctness over Abstract Data Types, with Error-State Semantics. North-Holland and CWI Monographs, Amsterdam, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, Kruislaan 413, 1098 SJ, Amsterdam, The Netherlands

    Krzysztof R. Apt

  2. Department of Computer Science, University of Oldenburg, Ammerlander Heerstr. 114-118, 2900, Oldenburg, Germany

    Ernst-Rüdiger Olderog

Authors
  1. Krzysztof R. Apt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ernst-Rüdiger Olderog
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Apt, K.R., Olderog, ER. (1991). Preliminaries. In: Verification of Sequential and Concurrent Programs. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4376-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-4376-0_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-4378-4

  • Online ISBN: 978-1-4757-4376-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation