Programs, Recursion and Unbounded Choice (Paperback)

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

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Cambridge Tracts in Theoretical Computer Science
Release date:	August 2005
First published:	1992
Authors:	Wim H. Hesselink
Dimensions:	245 x 170 x 12mm (L x W x T)
Format:	Paperback - Trade
Pages:	240
ISBN-13:	978-0-521-01829-6
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Promotions
LSN:	0-521-01829-3
Barcode:	9780521018296

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!