Items related to A Practical Theory of Programming (Monographs in Computer...
Synopsis
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for A Practical Theory of Programming (Monographs in Computer...
Seller Image
A Practical Theory of Programming (Hardback or Cased Book)
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Seller rating 5 out of 5 stars
Hardback or Cased Book. Condition: New. A Practical Theory of Programming 1.25. Book. Seller Inventory # BBS-9780387941066
Quantity: 5 available
Stock Image
A Practical Theory of Programming
Seller: Basi6 International, Irving, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-88753
Quantity: 1 available
Stock Image
A Practical Theory of Programming
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Seller Inventory # ABNR-81854
Quantity: 1 available
Stock Image
A Practical Theory of Programming (Monographs in Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780387941066_new
Quantity: Over 20 available
Seller Image
A Practical Theory of Programming
Published by
Springer New York Aug 1993, 1993
ISBN 10: 0387941061
ISBN 13: 9780387941066
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 260 pp. Englisch. Seller Inventory # 9780387941066
Quantity: 2 available
Stock Image
A Practical Theory of Programming
Published by
Springer-Verlag New York Inc., 1993
ISBN 10: 0387941061
ISBN 13: 9780387941066
New
Hardcover
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 700. Seller Inventory # C9780387941066
Quantity: Over 20 available
Stock Image
A Practical Theory of Programming
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: Used. pp. 260. Seller Inventory # 261776235
Quantity: 1 available
Seller Image
A Practical Theory of Programming
Published by
Springer New York, Springer US, 1993
ISBN 10: 0387941061
ISBN 13: 9780387941066
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9780387941066
Quantity: 1 available
Stock Image
A Practical Theory of Programming (Monographs in Computer Science)
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_366709036
Quantity: 1 available
Stock Image
A Practical Theory of Programming
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: Used. pp. 260 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam. Seller Inventory # 7120308
Quantity: 1 available