Programs Recursion Unbounded Choice: 27 (Cambridge Tracts in Theoretical Computer Science, Series Number 27)

Hesselink, Wim H.

ISBN 10: 0521018293 / ISBN 13: 9780521018296

Published by Cambridge University Press, 2008

About this Item

A complete account of the predicate transformation calculus semantics of sequential programs. Series Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 240 pages, black & white illustrations. BIC Classification: UYA. Category: (P) Professional & Vocational. Dimension: 247 x 174 x 13. Weight in Grams: 390. . 2008. paperback. . . . .

Seller Inventory # V9780521018296

Bibliographic Details

• Title: Programs Recursion Unbounded Choice: 27 (Cambridge Tracts in Theoretical Computer Science, Series Number 27)
• Publisher: Cambridge University Press
• Publication Date: 2008
• 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.