Sprache: Englisch
Verlag: Cambridge University Press, 2008
ISBN 10: 0521032512 ISBN 13: 9780521032513
Anbieter: Prior Books Ltd, Cheltenham, Vereinigtes Königreich
Erstausgabe
EUR 29,85
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. First Edition. A nearly new copy with no defects, just a few hardly noticeable rubs and bumps and a 'damaged' stamp to one of the preliminary pages. Despite such this book looks and feels unread with contents that are crisp, fresh and tight. Thus a very nice book in great condition, now offered for sale at a reasonable price.
Sprache: Englisch
Verlag: Cambridge University Press, 2006
ISBN 10: 0521032512 ISBN 13: 9780521032513
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 60,66
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2006
ISBN 10: 0521032512 ISBN 13: 9780521032513
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. The book can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 288 pages, black & white illustrations. BIC Classification: UMX; UYA. Category: (P) Professional & Vocational. Dimension: 247 x 174 x 15. Weight in Grams: 460. . 2008. Revised ed. paperback. . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press, 2006
ISBN 10: 0521032512 ISBN 13: 9780521032513
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e. deduction (in contrast with model-theoretic approaches, deductive methods can be automated to some extent). His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming; neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system. The book can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages.