Systematic Program Design
From Clarity to Efficiency
Published on 20. May 2013
Book
Hardback
252 pages
978-1-107-03660-4 (ISBN)
Description
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.
Reviews / Votes
'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, 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, ChoiceMore details
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises; 14 Line drawings, unspecified
Dimensions
Height: 240 mm
Width: 161 mm
Thickness: 19 mm
Weight
555 gr
ISBN-13
978-1-107-03660-4 (9781107036604)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
E-Book
06/2013
1st Edition
Cambridge University Press
€38.49
Available for download
Book
05/2013
Cambridge University Press
€59.30
Shipment within 15-20 days
E-Book
05/2013
Cambridge University Press
€32.99
Available for download
Person
Yanhong Annie Liu is a Professor of Computer Science at Stony Brook University. She received her BS from Peking University, MEng from Tsinghua University, and PhD from Cornell University. Her primary research has focused on general and systematic methods for program development, algorithm design, and problem solving. She has published in many top journals and conferences, served more than fifty conference chair or committee roles, and been awarded more than twenty research grants in her areas of expertise. She has taught more than twenty different courses in a wide range of Computer Science areas and presented close to a hundred research talks and invited talks at international conferences, universities, and research institutes. She received a State University of New York Chancellor's Award for Excellence in Scholarship and Creative Activities in 2010.
Content
1. Introduction; 2. Loops: incrementalize; 3. Sets: incrementalize and implement; 4. Recursion: iterate and incrementalize; 5. Rules: iterate, incrementalize, and implement; 6. Objects: incrementalize across module abstraction; 7. Conclusion.