**Hardcover**|

**$60.00 X**|

**£49.95**| 976 pp. | 8 x 9 in | 28 b&w illus. | May 2017 | ISBN: 9780262035538

**eBook**|

**$60.00 X**| April 2017 | ISBN: 9780262342490

**Mouseover for Online Attention Data**

## Look Inside

## Essential Info

## Instructor Resources

## Fundamental Proof Methods in Computer Science

## Overview

Proof is the primary vehicle for knowledge generation in mathematics. In computer science, proof has found an additional use: verifying that a particular system (or component, or algorithm) has certain desirable properties. This book teaches students how to read and write proofs using Athena, a freely downloadable computer language. Athena proofs are machine-checkable and written in an intuitive natural-deduction style. The book contains more than 300 exercises, most with full solutions. By putting proofs into practice, it demonstrates the fundamental role of logic and proof in computer science as no other existing text does. Guided by examples and exercises, students are quickly immersed in the most useful high-level proof methods, including equational reasoning, several forms of induction, case analysis, proof by contradiction, and abstraction/specialization. The book includes auxiliary material on SAT and SMT solving, automated theorem proving, and logic programming.

The book can be used by upper undergraduate or graduate computer science students with a basic level of programming and mathematical experience. Professional programmers, practitioners of formal methods, and researchers in logic-related branches of computer science will find it a valuable reference.

## Instructor Resources for This Title:

## About the Authors

Konstantine Arkoudas is a Senior Research Scientist and Software Architect at Bloomberg.

David Musser is Professor Emeritus of Computer Science at Rensselaer Polytechnic Institute.

## Endorsements

—

**Peter Norvig**, Director of Research, Google

*Fundamental Proof Methods in Computer Science*is well thought out and carefully written. The text introduces formal notation from the outset, and employs it throughout the presentation. No other book that I know of brings with it the formalism necessary for mechanized logic processing. This is a significant contribution to the teaching of applications of formal logic in problems relevant to computer science.”

—

**Rex Page**, Professor Emeritus, School of Computer Science, University of Oklahoma, coauthor of

*Discrete Mathematics Using a Computer*

—

**Alexander Stepanov**, coauthor of

*Elements of Programming*and

*From Mathematics to Generic Programming*