Authors:
- Suitable for graduate students and researchers in theoretical computer science and logic
- Teaches reader the art of precise logical reasoning and the practical use of a proof assistant
- Represents a formal approach to computer science, not just semantics
- Includes supplementary material: sn.pub/extras
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (13 chapters)
-
Front Matter
-
Back Matter
About this book
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.
Reviews
Authors and Affiliations
-
TU München Fak. Informatik, Garching, Germany
Tobias Nipkow
-
Kensington Campus, Bldg L5, NICTA, Neville Roach Laboratory, Kensington, Australia
Gerwin Klein
About the authors
Prof. Tobias Nipkow received his Ph.D. in Manchester, after which he taught and carried out research at MIT and in Cambridge. He took up a professorship in 1992 at the Technische Universität München where he holds the Chair for Logic and Verification. He was one of the developers of Isabelle, a generic proof assistant, and he coauthored the related LNCS tutorial. He also coauthored the textbook "Term Rewriting and All That", and he is the Editor-in-Chief of the Journal of Automated Reasoning. His research interests include automatic and interactive theorem proving, formal verification, formalizing programming languages, type systems, semantics, rewriting and unification, and the lambda-calculus.
Assoc. Prof. Gerwin Klein received his Ph.D. in Computer Science from the Technische Universität München. He is a Senior Principal Researcher/Research Leader at National ICT Australia (NICTA) and an adjunct professor in the School of Computer Science and Engineering, University of NewSouth Wales. His research interests include interactive theorem proving, software verification, and the semantics of programming languages.
Bibliographic Information
Book Title: Concrete Semantics
Book Subtitle: With Isabelle/HOL
Authors: Tobias Nipkow, Gerwin Klein
DOI: https://doi.org/10.1007/978-3-319-10542-0
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2014
Hardcover ISBN: 978-3-319-10541-3Published: 15 December 2014
Softcover ISBN: 978-3-319-35759-1Published: 10 September 2016
eBook ISBN: 978-3-319-10542-0Published: 03 December 2014
Edition Number: 1
Number of Pages: XIII, 298
Number of Illustrations: 86 b/w illustrations, 1 illustrations in colour
Topics: Logics and Meanings of Programs, Programming Languages, Compilers, Interpreters, Mathematical Logic and Formal Languages