practical theory programming von hehner eric (30 Ergebnisse)

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

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

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

Zustand: New. In.

Zustand: New. In.

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

Paperback. Zustand: New.

Zustand: New. SUPER FAST SHIPPING.

Zustand: New. SUPER FAST SHIPPING.

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

Zustand: New. pp. 260.

Zustand: New. pp. 260.

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

Zustand: New. pp. 260.

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

Zustand: New.

Zustand: New.

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

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

Hardcover. Zustand: Like New. Like New. book.

Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 b.

Kartoniert / Broschiert. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 b.

Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. 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.

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

Paperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 506.

Hardback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 700.

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

Zustand: New. PRINT ON DEMAND pp. 260.

Zustand: New. Print on Demand pp. 260 66:B&W 7 x 10 in or 254 x 178 mm Perfect Bound on White w/Gloss Lam.