Skip to main content

Developing Loops from Invariants and Bounds

  • Chapter
The Science of Programming

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

  • 1029 Accesses

Abstract

This chapter discusses two methods for developing a loop when the precondition Q, the postcondition R, the invariant P and the bound function t are given. The first method leads naturally to a loop with a single guarded command, do BS od. The second takes advantage of the flexibility of the iterative construct and generally results in loops with more than one guarded command.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Gries, D. (1981). Developing Loops from Invariants and Bounds. In: The Science of Programming. Text and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5983-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-5983-1_16

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96480-5

  • Online ISBN: 978-1-4612-5983-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics