Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development

Author: Yves Bertot

Publisher: Springer Science & Business Media

Published: 2013-03-14

Total Pages: 492

ISBN-13: 366207964X

DOWNLOAD EBOOK

A practical introduction to the development of proofs and certified programs using Coq. An invaluable tool for researchers, students, and engineers interested in formal methods and the development of zero-fault software.

Machine Learning for Automated Theorem Proving
Machine Learning for Automated Theorem Proving

Author: Sean B. Holden

Publisher:

Published: 2021-11-22

Total Pages: 202

ISBN-13: 9781680838985

DOWNLOAD EBOOK

In this book, the author presents the results of his thorough and systematic review of the research at the intersection of two apparently rather unrelated fields: Automated Theorem Proving (ATP) and Machine Learning (ML).

Certified Programming with Dependent Types
Certified Programming with Dependent Types

Author: Adam Chlipala

Publisher: MIT Press

Published: 2013-12-06

Total Pages: 437

ISBN-13: 0262317885

DOWNLOAD EBOOK

A handbook to the Coq software for writing and checking mathematical proofs, with a practical engineering focus. The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer science, and related tools for formal proof-checking are seeing increasing adoption in mathematics and engineering. This book provides an introduction to the Coq software for writing and checking mathematical proofs. It takes a practical engineering focus throughout, emphasizing techniques that will help users to build, understand, and maintain large Coq developments and minimize the cost of code change over time. Two topics, rarely discussed elsewhere, are covered in detail: effective dependently typed programming (making productive use of a feature at the heart of the Coq system) and construction of domain-specific proof tactics. Almost every subject covered is also relevant to interactive computer theorem proving in general, not just program verification, demonstrated through examples of verified programs applied in many different sorts of formalizations. The book develops a unique automated proof style and applies it throughout; even experienced Coq users may benefit from reading about basic Coq concepts from this novel perspective. The book also offers a library of tactics, or programs that find proofs, designed for use with examples in the book. Readers will acquire the necessary skills to reimplement these tactics in other settings by the end of the book. All of the code appearing in the book is freely available online.

Logic for Computer Science
Logic for Computer Science

Author: Jean H. Gallier

Publisher: Courier Dover Publications

Published: 2015-06-18

Total Pages: 532

ISBN-13: 0486780821

DOWNLOAD EBOOK

This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic; SLD-resolution, logic programming, and the foundations of PROLOG; and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information.

Automated Theorem Proving
Automated Theorem Proving

Author: Monty Newborn

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 244

ISBN-13: 1461300894

DOWNLOAD EBOOK

This text and software package introduces readers to automated theorem proving, while providing two approaches implemented as easy-to-use programs. These are semantic-tree theorem proving and resolution-refutation theorem proving. The early chapters introduce first-order predicate calculus, well-formed formulae, and their transformation to clauses. Then the author goes on to show how the two methods work and provides numerous examples for readers to try their hand at theorem-proving experiments. Each chapter comes with exercises designed to familiarise the readers with the ideas and with the software, and answers to many of the problems.

Concrete Semantics
Concrete Semantics

Author: Tobias Nipkow

Publisher: Springer

Published: 2014-12-03

Total Pages: 304

ISBN-13: 3319105426

DOWNLOAD EBOOK

Part I of this book is a practical introduction to working with the Isabelle proof assistant. It teaches you how to write functional programs and inductive definitions and how to prove properties about them in Isabelle’s structured proof language. Part II is an introduction to the semantics of imperative languages with an emphasis on applications like compilers and program analysers. The distinguishing feature is that all the mathematics has been formalised in Isabelle and much of it is executable. Part I focusses on the details of proofs in Isabelle; Part II can be read even without familiarity with Isabelle’s proof language, all proofs are described in detail but informally. The book teaches the reader the art of precise logical reasoning and the practical use of a proof assistant as a surgical tool for formal proofs about computer science artefacts. In this sense it represents a formal approach to computer science, not just semantics. The Isabelle formalisation, including the proofs and accompanying slides, are freely available online, and the book is suitable for graduate students, advanced undergraduate students, and researchers in theoretical computer science and logic.

A Computational Logic
A Computational Logic

Author: Robert S. Boyer

Publisher: Academic Press

Published: 2014-06-25

Total Pages: 414

ISBN-13: 1483277887

DOWNLOAD EBOOK

ACM Monograph Series: A Computational Logic focuses on the use of induction in proving theorems, including the use of lemmas and axioms, free variables, equalities, and generalization. The publication first elaborates on a sketch of the theory and two simple examples, a precise definition of the theory, and correctness of a tautology-checker. Topics include mechanical proofs, informal development, formal specification of the problem, well-founded relations, natural numbers, and literal atoms. The book then examines the use of type information to simplify formulas, use of axioms and lemmas as rewrite rules, and the use of definitions. Topics include nonrecursive functions, computing values, free variables in hypothesis, infinite backwards chaining, infinite looping, computing type sets, and type prescriptions. The manuscript takes a look at rewriting terms and simplifying clauses, eliminating destructors and irrelevance, using equalities, and generalization. Concerns include reasons for eliminating isolated hypotheses, precise statement of the generalization heuristic, restricting generalizations, precise use of equalities, and multiple destructors and infinite looping. The publication is a vital source of data for researchers interested in computational logic.

Machine Proofs in Geometry
Machine Proofs in Geometry

Author: Shang-Ching Chou

Publisher: World Scientific

Published: 1994

Total Pages: 490

ISBN-13: 9789810215842

DOWNLOAD EBOOK

This book reports recent major advances in automated reasoning in geometry. The authors have developed a method and implemented a computer program which, for the first time, produces short and readable proofs for hundreds of geometry theorems.The book begins with chapters introducing the method at an elementary level, which are accessible to high school students; latter chapters concentrate on the main theme: the algorithms and computer implementation of the method.This book brings researchers in artificial intelligence, computer science and mathematics to a new research frontier of automated geometry reasoning. In addition, it can be used as a supplementary geometry textbook for students, teachers and geometers. By presenting a systematic way of proving geometry theorems, it makes the learning and teaching of geometry easier and may change the way of geometry education.