Skip to main content

Experience with inductive assertions for proving programs correct

Part of the Lecture Notes in Mathematics book series (LNM,volume 188)

Keywords

  • Program Logic
  • Theorem Prover
  • Verification Condition
  • Automatic Theorem Prover
  • Text String

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • 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.

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1971 Springer-Verlag

About this paper

Cite this paper

London, R.L. (1971). Experience with inductive assertions for proving programs correct. In: Engeler, E. (eds) Symposium on Semantics of Algorithmic Languages. Lecture Notes in Mathematics, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059700

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05377-4

  • Online ISBN: 978-3-540-36499-3

  • eBook Packages: Springer Book Archive