Concrete Semantics: With Isabelle/HOL
Nipkow, Tobias; Klein, Gerwin
Sold by Lucky's Textbooks, Dallas, TX, U.S.A.
AbeBooks Seller since 22 July 2022
New - Hardcover
Condition: New
Quantity: Over 20 available
Add to basketSold by Lucky's Textbooks, Dallas, TX, U.S.A.
AbeBooks Seller since 22 July 2022
Condition: New
Quantity: Over 20 available
Add to basketPart 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.
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.
"About this title" may belong to another edition of this title.
We guarantee the condition of every book as it's described on the AbeBooks web
sites. Please note that used items may not include access codes or cards, CD's
or other accessories, regardless of what is stated in item title. If you need to
guarantee that these items are included, please purchase a brand new copy.
All requests for refunds and/or returns will be processed in accordance with
AbeBooks policies. If you're dissatisfied with your purchase (Incorrect Book/Not
as Described/Damaged) or if ...
Books ordered via expedited shipping should arrive between 2 and 7 business days after shipment confirmation. Books ordered via standard shipping should arrive between 4 and 14 business days after shipment confirmation.