1300 36 33 32

This book is a complete account of the predicate transformation calculus semantics of sequential programs, including repetitions, recursive procedures, computational induction and unbounded nondeterminacy. Predicate transformation semantics are the best specification method for the development of correct and well-structured computer programs. The author develops this theory to a greater depth than has been achieved before, and describes it in a way that makes it readily compatible with 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. This will be essential reading for all computer scientists working in specification and verification of programs.

Buy Programs, Recursion and Unbounded Choice book by Wim H. Hesselink from Australia's Online Bookstore, Boomerang Books.

Book Details

ISBN: 9780521018296
ISBN-10: 0521018293
Format: Paperback
(247mm x 174mm x 13mm)
Pages: 240
Imprint: Cambridge University Press
Publisher: Cambridge University Press
Publish Date: 22-Aug-2005
Country of Publication: United Kingdom

Other Editions


» Have you read this book? We'd like to know what you think about it - write a review about Programs, Recursion and Unbounded Choice book by Wim H. Hesselink and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a member - it's free to sign up!)

Write Review