
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This book offers a comprehensive treatment of the process of constructing computer programs through stepwise resolutions of relational equations. Unlike other books that take a logic-based approach to the topic, the authors derive constructive solutions to these equations by means of programming heuristics, three classes of which are presented in detail: sequence heuristics are used to decompose the specification of an initialization segment and the specification of while loop; iteration heuristics decompose the specification of a while loop into specification of the loop body and the while condition; generalization heuristics generalize a specification so as to strip away unimportant detail and focus on key aspects of the problem that it represents. The authors have taught this course many times over the years, and their experience is wonderfully showcased in this definitive introduction to the subject. Advanced undergraduate and graduate students studying program construction, as well as computer science researchers, will appreciate the texts emphasis on the use of computation in the construction process, reducing the discretionary aspects of programming to their simplest level.
This book investigates the systematic construction of computer programs through the resolution of relational equations rather than traditional logic-based methodologies. The authors, Ali Mili, Fatma Mili, and Jules Desharnais, leverage their extensive academic experience to present a structured framework for program development. By focusing on programming heuristics, the text provides a rigorous approach to decomposing specifications into executable code, aiming to reduce the discretionary and often subjective nature of software design to a more predictable, methodical process.
What You Will Find
Experts and academics recognize this text as a foundational resource for advanced students and researchers interested in the formal underpinnings of software construction. Readers frequently note the technical density of the prose, which requires a strong background in discrete mathematics and formal methods to fully grasp the proposed heuristics.
Page Count:
400
Publication Date:
1994-06-23
Publisher:
Oxford University Press
ISBN-10:
0195092368
ISBN-13:
9780195092363
No comments yet. Be the first to share your thoughts!