Softcover. Condizione: Very Good. Used very good, all pages clean, ex-library book Quantity Available: 1. Category: Computers & Internet; ISBN: 0817631569. ISBN/EAN: 9780817631567. Pictures of this item not already displayed here available upon request. Inventory No: ABE216362623.
EUR 7,76
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Good. Volume 5. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,550grams, ISBN:0817631712.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,58
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Lingua: Inglese
Editore: Boston/Basel/Stuttgart, Birkhäuser, 1983
ISBN 10: 0817631712 ISBN 13: 9780817631710
Da: Antiquariat Orban & Streu GbR, Frankfurt am Main, Germania
Prima edizione
EUR 35,00
Quantità: 1 disponibili
Aggiungi al carrelloErstausgabe / First Edition, 8°, 357 S., Text: englisch, orange original Kartonage (Paperback), der Rücken und die Rückenkanten etwas aufgehellt, sonst ein gutes, textsauberes Exemplar Abholung im Ladengeschäft in Frankfurt am Main (Nordend ggü. Musterschule) möglich. Das spart die Portokosten. Pickup at the store in Frankfurt am Main (Nordend, close to Musterschule) is possible. It saves the shipping costs.
EUR 69,23
Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New. Series: Progress in Computer Science and Applied Logic. Num Pages: 359 pages, biography. BIC Classification: UYA. Category: (G) General (US: Trade). Dimension: 229 x 152 x 19. Weight in Grams: 538. . 1983. Paperback. . . . .
Condizione: New. pp. 368.
EUR 79,42
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 1st edition. 368 pages. 9.00x5.75x0.75 inches. In Stock.
Condizione: New. Series: Progress in Computer Science and Applied Logic. Num Pages: 359 pages, biography. BIC Classification: UYA. Category: (G) General (US: Trade). Dimension: 229 x 152 x 19. Weight in Grams: 538. . 1983. Paperback. . . . . Books ship from the US and Ireland.
Lingua: Inglese
Editore: Birkhäuser, Boston, Basel, Stuttgart, 1983
ISBN 10: 0817631569 ISBN 13: 9780817631567
Da: Antiquariat Kastanienhof, Pirna, Germania
EUR 24,50
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Fine. 15,5 x 23,5 cm Original-Pappband ohne Schutzumschlag, SEHR GUTES EXEMPLAR---Progress in Computer Science No. 5. Edited by J. Bentley, E. Coffman, R. L. Graham, D. Kuck, N. Pippenger. In englischer Sprache. Für Ihre Zufriedenheit versenden wir mit DHL und ausschließlich mit Trackingcode für eine sichere Sendungsverfolgung! Weitere Angebote unter antiquariat-kastanienhof , 357 Seiten. nein.
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloKartoniert / Broschiert. Condizione: New.
EUR 59,97
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - -Ecclesiastes 12:12 Programs are invariably subjected to many rorms or transrormation. After an initial version of a program has been designed and developed, it undergoes debugging and certification. In addition, most long-lived pro grams have a liCe-cycle that includes modifications to meet amended specifications and extensions for expanded capabilities. Such evolution ary aspects of programming are the topic of this monograph. We present rormal methods for manipulating programs and illustrate their applica tion with numerous examples. Such methods could be incorporated in semi-automated programming environments, where they would serve to ease the burden on the programmer. We begin by describing a method whereby a given program that achieves one goal can be modified to achieve a different goal or a pro gram that computes wrong results can be debugged to achieve the 2 Preface intended results. The abstraction of a set of cognate programs to obtain a program schema, and the instantiation of abstract schemata to solve concrete problems, are approached from the same perspective. In addition, we describe synthesis rules for generating code from specifications and annotation rules for making assertions about code. The synthesis rules may be used when a program is first being developed, or when, in the course of modifying a program, the need arises to rewrite a program segment. Annotation rules may be used for the purpose of determining what an incorrect program really does before attempting to debug it or how a correct program works before attempting to modify it.
Da: Majestic Books, Hounslow, Regno Unito
EUR 78,65
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 368 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 68,75
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 78,95
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 368.
Lingua: Inglese
Editore: Birkhäuser Boston Jan 1983, 1983
ISBN 10: 0817631712 ISBN 13: 9780817631710
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 85,55
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware --Ecclesiastes 12:12 Programs are invariably subjected to many rorms or transrormation. After an initial version of a program has been designed and developed, it undergoes debugging and certification. In addition, most long-lived pro grams have a liCe-cycle that includes modifications to meet amended specifications and extensions for expanded capabilities. Such evolution ary aspects of programming are the topic of this monograph. We present rormal methods for manipulating programs and illustrate their applica tion with numerous examples. Such methods could be incorporated in semi-automated programming environments, where they would serve to ease the burden on the programmer. We begin by describing a method whereby a given program that achieves one goal can be modified to achieve a different goal or a pro gram that computes wrong results can be debugged to achieve the 2 Preface intended results. The abstraction of a set of cognate programs to obtain a program schema, and the instantiation of abstract schemata to solve concrete problems, are approached from the same perspective. In addition, we describe synthesis rules for generating code from specifications and annotation rules for making assertions about code. The synthesis rules may be used when a program is first being developed, or when, in the course of modifying a program, the need arises to rewrite a program segment. Annotation rules may be used for the purpose of determining what an incorrect program really does before attempting to debug it or how a correct program works before attempting to modify it. 368 pp. Englisch.
Lingua: Inglese
Editore: Birkhäuser, Birkhäuser Jan 1983, 1983
ISBN 10: 0817631712 ISBN 13: 9780817631710
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware --Ecclesiastes 12:12 Programs are invariably subjected to many rorms or transrormation. After an initial version of a program has been designed and developed, it undergoes debugging and certification. In addition, most long-lived pro grams have a liCe-cycle that includes modifications to meet amended specifications and extensions for expanded capabilities. Such evolution ary aspects of programming are the topic of this monograph. We present rormal methods for manipulating programs and illustrate their applica tion with numerous examples. Such methods could be incorporated in semi-automated programming environments, where they would serve to ease the burden on the programmer. We begin by describing a method whereby a given program that achieves one goal can be modified to achieve a different goal or a pro gram that computes wrong results can be debugged to achieve the 2 Preface intended results. The abstraction of a set of cognate programs to obtain a program schema, and the instantiation of abstract schemata to solve concrete problems, are approached from the same perspective. In addition, we describe synthesis rules for generating code from specifications and annotation rules for making assertions about code. The synthesis rules may be used when a program is first being developed, or when, in the course of modifying a program, the need arises to rewrite a program segment. Annotation rules may be used for the purpose of determining what an incorrect program really does before attempting to debug it or how a correct program works before attempting to modify it.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 368 pp. Englisch.