|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Tobias Nipkow , Gerwin KleinPublisher: Springer International Publishing AG Imprint: Springer International Publishing AG Edition: Softcover reprint of the original 1st ed. 2014 Dimensions: Width: 15.50cm , Height: 1.70cm , Length: 23.50cm Weight: 4.745kg ISBN: 9783319357591ISBN 10: 331935759 Pages: 298 Publication Date: 10 September 2016 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of ContentsIntroduction.- 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.ReviewsThe 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) Author InformationProf. 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. Tab Content 6Author Website:Countries AvailableAll regions |