Buch, Englisch, 285 Seiten, Format (B × H): 178 mm x 254 mm, Gewicht: 651 g
Buch, Englisch, 285 Seiten, Format (B × H): 178 mm x 254 mm, Gewicht: 651 g
Reihe: Cambridge Tracts in Theoretical Computer Science
ISBN: 978-0-521-41723-5
Verlag: Cambridge University Press
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.
Autoren/Hrsg.
Weitere Infos & Material
Introduction; 1. Preliminaries; 2. Guards, generators and constructors; 3. Models and correctness; 4. Computing goal solutions; 5. Inductive expansion; 6. Directed expansion and reduction; 7. Implications of ground confluence; 8. Examples; 9. EXPANDER: inductive expansion in SML; References; Index.
