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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
