Sold Out
Book Categories |
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.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionPrograms, recursion and unbounded choice
X
This Item is in Your InventoryPrograms, recursion and unbounded choice
X
You must be logged in to review the productsX
X
X
Add Programs, recursion and unbounded choice, , Programs, recursion and unbounded choice to the inventory that you are selling on WonderClubX
X
Add Programs, recursion and unbounded choice, , Programs, recursion and unbounded choice to your collection on WonderClub |