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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
