Programs, Recursion and Unbounded Choice

Wim H. Hesselink Hesselink Wim H.

ISBN 10: 0521018293 / ISBN 13: 9780521018296

Published by Cambridge University Press, 2005

About this Item

Print on Demand pp. 240 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Seller Inventory # 7445815

Bibliographic Details

• Title: Programs, Recursion and Unbounded Choice
• Publisher: Cambridge University Press
• Publication Date: 2005
• Language: English
• ISBN 10: 0521018293
• ISBN 13: 9780521018296
• Binding: Soft cover
• Condition: New

About this title

Synopsis

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.

Book Description

Predicate transformation semantics are 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, developed by the author to a greater depth than has been achieved before.