| A Practical Theory of Programming 1993 Edition Contributor(s): Hehner, Eric C. R. (Author) |
|
 |
ISBN: 0387941061 ISBN-13: 9780387941066 Publisher: Springer OUR PRICE: $52.24 Product Type: Hardcover - Other Formats Published: August 1993 Annotation: Eric Hehner describes a programming theory that is simpler and more comprehensive than the current theories to date. Contains 373 exercises for classroom use and 26 worked-out problems. |
| Additional Information |
| BISAC Categories: - Computers | Programming - General - Education |
| Dewey: 005.1 |
| LCCN: 93005269 |
| Series: Texts & Monographs in Computer Science |
| Physical Information: 0.7" H x 7.17" W x 9.55" (1.25 lbs) 247 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: There are several theories of programming. The first usable theory, often called "Hoare's Logic", is still probably the most widely known. In it, a specification is a pair of predicates: a precondition and postcondition (these and all technical terms will be defined in due course). Another popular and closely related theory by Dijkstra uses the weakest precondition predicate transformer, which is a function from programs and postconditions to preconditions. lones's Vienna Development Method has been used to advantage in some industries; in it, a specification is a pair of predicates (as in Hoare's Logic), but the second predicate is a relation. Temporal Logic is yet another formalism that introduces some special operators and quantifiers to describe some aspects of computation. The theory in this book is simpler than any of those just mentioned. In it, a specification is just a boolean expression. Refinement is just ordinary implication. This theory is also more general than those just mentioned, applying to both terminating and nonterminating computation, to both sequential and parallel computation, to both stand-alone and interactive computation. And it includes time bounds, both for algorithm classification and for tightly constrained real-time applications. |