Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Programs, Recursion and Unbounded Choice

by Wim H. Hesselink , Hesselink Wim H. , C. J. Van Rijsbergen
Save 2% Save 2%
Current price ₹5,992.00
Original price ₹6,110.00
Original price ₹6,110.00
Original price ₹6,110.00
(-2%)
₹5,992.00
Current price ₹5,992.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9780521018296
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Cambridge University Press
  • Publisher Imprint: Cambridge University Press
  • Publication Date:
  • Pages: 240
  • Original Price: GBP 47.0
  • Language: English
  • Edition: N/A
  • Item Weight: 391 grams
  • BISAC Subject(s): Software Development & Engineering / General

Predicate transformation semantics is the best specification method for the development of correct and well-structured computer programs. This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction, and unbounded nondeterminacy. The author develops their theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with programming methodology. He gives proofs of the programming rules for partial and total correctness of repetitions and recursive procedures, supplies new rules for proving incorrectness, and a stronger rule for proving that two programs satisfy the same specifications. Finally, the semantics are extended so that non-terminating programs can be specified as well.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us