practical theory programming di hehner eric (41 risultati)

Condizione: New.

Condizione: New.

Hardcover. Condizione: new. Hardcover. Understanding programming and programming languages requires knowledge of the underlying theoretical model. This book explores aspects of programming that are amenable to mathematical proof. The author describes a programming theory which is much simpler and more comprehensive than the current theories to date. In the theoretical model, a specification is just a boolean expression and refinement is just an ordinary implication. The author develops a practical and broad method for writing precise specifications and designing programs whose executions probably satisfy the specifications. Beginning with preparatory material in logic, numbers, sets, lists, functions and relations, the book advances further into program theory, the heart of the book. Subsequent chapters may be selected or omitted according to course emphasis. The text will be useful to students in courses on programming methodology or verification at the advanced undergraduate or beginning graduate level, as well as for software engineers in the field. All technical terms are explained and then demonstrated in the book wherever possible. No advanced mathematical knowledge or programming language is assumed.The book contains numerous exercises and worked-out solutions for specific exercises. Transparency masters and solutions for the remaining exercises are available from the author. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Paperback. Condizione: new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condizione: New.

Condizione: New.

Condizione: New. SUPER FAST SHIPPING.

Condizione: New. SUPER FAST SHIPPING.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Condizione: 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.

Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.

Condizione: New. In.

Condizione: New. In.

Condizione: New. pp. 260.

Paperback. Condizione: New.

Condizione: New. pp. 260 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam.

Condizione: New. pp. 260.

Hardback or Cased Book. Condizione: New. A Practical Theory of Programming 1.25. Book.

Condizione: New. pp. 260.

Condizione: New. Explores various aspects of programming that are amenable to mathematical proof. This book is useful to students in courses on programming methodology or verification at the advanced undergraduate or beginning graduate level, as well as for software engineers in the field. Series: Monographs in Computer Science. Num Pages: 257 pages, biography. BIC Classification: UM. Category: (G) General (US: Trade); (UP) Postgraduate, Research & Scholarly. Dimension: 254 x 178 x 15. Weight in Grams: 670. . 1993. Hardback. . . . .

Condizione: New. Series: Monographs in Computer Science. Num Pages: 257 pages, biography. BIC Classification: UMZ. Category: (P) Professional & Vocational. Dimension: 254 x 178 x 14. Weight in Grams: 500. . 2012. Softcover reprint of the original 1st ed. 1993. Paperback. . . . .

Hardcover. Condizione: 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!

Condizione: New. Explores various aspects of programming that are amenable to mathematical proof. This book is useful to students in courses on programming methodology or verification at the advanced undergraduate or beginning graduate level, as well as for software engineers in the field. Series: Monographs in Computer Science. Num Pages: 257 pages, biography. BIC Classification: UM. Category: (G) General (US: Trade); (UP) Postgraduate, Research & Scholarly. Dimension: 254 x 178 x 15. Weight in Grams: 670. . 1993. Hardback. . . . . Books ship from the US and Ireland.

Condizione: New. Series: Monographs in Computer Science. Num Pages: 257 pages, biography. BIC Classification: UMZ. Category: (P) Professional & Vocational. Dimension: 254 x 178 x 14. Weight in Grams: 500. . 2012. Softcover reprint of the original 1st ed. 1993. Paperback. . . . . Books ship from the US and Ireland.

Paperback. Condizione: Brand New. reprint edition. 243 pages. 9.75x7.00x0.75 inches. In Stock.

Buch. Condizione: Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 260 pp. Englisch.

Taschenbuch. Condizione: 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.

hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!

Buch. Condizione: 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.