A systematic program design method can help developers ensure the correctness and performance of programs while minimizing the development cost. This book describes a method that starts with a clear specification of a computation and derives an efficient implementation by step-wise program analysis and transformations. The method applies to problems specified in imperative, database, functional, logic and object-oriented programming languages with different data, control and module abstractions. Designed for courses or self-study, this book includes numerous exercises and examples that require minimal computer science background, making it accessible to novices. Experienced practitioners and researchers will appreciate the detailed examples in a wide range of application areas including hardware design, image processing, access control, query optimization and program analysis. The last section of the book points out directions for future studies.
'As an experienced programmer and educator, I have to admit, I felt deep enjoyment while reading this book. It was a pleasant experience.'
M. M. Tanik Source: Computing Reviews
'It will prove very useful for graduate students who wish to start their literature review with a comprehensive example of the state of the art in formal methods, and it is an excellent platform for self-directed learning. This well-structured, comprehensive book reflects the author's experience and strong background in the field. Highly recommended.'
L. Benedicenti Source: Choice
Loading metrics...
* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.
Usage data cannot currently be displayed.
This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.
Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.