Author Description

Recent developments in computing curriculums have proposed that theory should be a fundamental part of computing education instead of remaining segregated in optional courses. Many colleges and universities develop students' capabilities in small-scale programming but neglect the development of their critical abilities. Advocates of integrating theory into more general courses believe that in order to provide students with the essential tools to understand and substantiate their work, it is necessary to introduce more formal theory into lower-level courses. Reasoning About Programs embraces this approach. It integrates two different theoretical techniques that are usually introduced separately in upper-level courses: verification of programs and analysis of algorithms. The author offers an in-depth treatment of the material, providing the necessary tools for students to analyze the procedures they are reading and writing instead of only using them on toy examples. Ideal as a supplementary text for lower-level undergraduate courses in computer science, this accessible book is written in a user-friendly style and includes numerous examples and exercises.