Concrete Semantics - With Isabelle/HOL

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.

Sommario

Introduction.- Programming and Proving.- Case Study: IMP Expressions.- Logic and Proof Beyond Equality.- Isar: A Language for Structured Proofs.- IMP: A Simple Imperative Language.- Compiler.- Types.- Program Analysis.- Denotational Semantics.- Hoare Logic.- Abstract Interpretation.- App. A, Auxiliary Definitions.- App. B, Symbols.- References.

Relazione

"The book is highly recommended for learning and teaching theorem proving and semantics, picking up a lot of useful knowledge on higher-order logic along the way. The book is well-structured and written to support learning about the two main themes. It may also help to make formal methods more approachable to a larger number of students by offering the possibility to follow the book with a software tool, inviting the students to experiment and succeed in (automatically assisted) formal proof." (Stefan Hallerstede, Formal Aspects of Computing, Vol. 30, 2018)

Dettagli sul prodotto

• Autori: Gerwin Klein, Tobias Nipkow
• Editore: Springer, Berlin
• Lingue: Inglese
• Formato: Copertina rigida
• Pubblicazione: 15.12.2014
• EAN: 9783319105413
• ISBN: 978-3-31-910541-3
• Pagine: 298
• Dimensioni: 158 mm x 241 mm x 28 mm
• Peso: 604 g
• Illustrazioni: XIII, 298 p. 87 illus., 1 illus. in color.
• Categorie: Scienze naturali, medicina, informatica, tecnica > Informatica, EDP > Informatica; B, Compiler und Übersetzer, computer science, Theory of Computation, Logics and Meanings of Programs, Programming Languages, Compilers, Interpreters, Mathematical theory of computation, Mathematical logic, Mathematical Logic and Foundations, Mathematical Logic and Formal Languages, Computer architecture & logic design, Programming & scripting languages: general, Compilers & interpreters, Programming languages (Electronic computers), Computer logic, Formal Languages and Automata Theory, Compilers and Interpreters