
Program Construction
Cambridge University Press
Published on 5. February 1987
Book
Paperback/Softback
384 pages
978-0-521-31883-9 (ISBN)
Description
This textbook is an introduction to the design and writing of computer programs. It leads the reader through all the stages of program construction from the original specifications through to the final program. The formal verification of intermediate versions of the program is studied in considerable detail. The authors show how, given the formal specification of a program, data structure and program structure diagrams are drawn and then converted into a procedural program in a program design language (PDL). They demonstrate the conversion of PDL into a variety of real programming languages including Pascal, FORTRAN, COBOL, and Assembler. The book also includes chapters on abstract data types, analysing existing programs, and a small case study. First-year undergraduates in computer science and graduates taking courses in computing will find this a comprehensive introduction to program construction.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Target group
College/higher education
Product notice
Paperback (trade)
Illustrations
Worked examples or Exercises
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 23 mm
Weight
622 gr
ISBN-13
978-0-521-31883-9 (9780521318839)
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

R. G. Stone | D. J. Cooke
Program Construction
Book
02/1987
Cambridge University Press
€46.43
Article exhausted; check for reprint
Previous edition

R. G. Stone | D. J. Cooke
Program Construction
Book
02/1987
Cambridge University Press
€46.43
Article exhausted; check for reprint
Content
Preface; 1. A modern approach to computing; 2. Specifications I; 3. Diagrams; 4. Specifications II; 5. PDL; 6. Code generation; 7. Verification; 8. Examination of templates and target code; 9. Abstract data types; 10. The mathematical basis of abstract data types; 11. Utilisation of existing programs; 12. A small scale study - topological sorting; Appendices; References; Index.