"Fundamental proof methods in computer science" - Information and Links:

Fundamental proof methods in computer science - Info and Reading Options

a computer-based approach

"Fundamental proof methods in computer science" was published in 2017 - mau, it has 941 pages and the language of the book is English.


“Fundamental proof methods in computer science” Metadata:

  • Title: ➤  Fundamental proof methods in computer science
  • Author:
  • Language: English
  • Number of Pages: 941
  • Publish Date:
  • Publish Location: mau

“Fundamental proof methods in computer science” Subjects and Themes:

Edition Specifications:

  • Pagination: xxvii, 941 pages

Edition Identifiers:

AI-generated Review of “Fundamental proof methods in computer science”:


"Fundamental proof methods in computer science" Table Of Contents:

  • 1- Introduction --
  • 2- Fundamental proof methods --
  • 3- Proofs about fundamental data types --
  • 4- Proofs about algorithms --
  • 5- Proofs at an abstract level --
  • 6- Proofs about programming languages -- -- appendix A.
  • 7- Athena reference --
  • 8- appendix B.
  • 9- Logic programming and Prolog.

"Fundamental proof methods in computer science" Description:

The Open Library:

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. -- Provided by publisher.

Read “Fundamental proof methods in computer science”:

Read “Fundamental proof methods in computer science” by choosing from the options below.

Search for “Fundamental proof methods in computer science” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Fundamental proof methods in computer science” in Libraries Near You:

Read or borrow “Fundamental proof methods in computer science” from your local library.

Buy “Fundamental proof methods in computer science” online:

Shop for “Fundamental proof methods in computer science” on popular online marketplaces.