Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Programs, Recursion and Unbounded Choice

Programs, Recursion and Unbounded Choice

Hesselink, Wim H.
Van Rijsbergen, C. J.
Wim H., Hesselink

Paperback

Series: Cambridge Tracts in Theoretical Computer Science, Book 27

Programming

ISBN10: 0521018293
ISBN13: 9780521018296
Publisher: Cambridge University Press
Published: Aug 22 2005
Pages: 240
Weight: 0.86
Height: 0.51 Width: 6.69 Depth: 9.61
Language: English
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.

Also in

Programming

View All