|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-319-10542-0 |
003 |
DE-He213 |
005 |
20220119075845.0 |
007 |
cr nn 008mamaa |
008 |
141203s2014 sz | s |||| 0|eng d |
020 |
|
|
|a 9783319105420
|9 978-3-319-10542-0
|
024 |
7 |
|
|a 10.1007/978-3-319-10542-0
|2 doi
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
072 |
|
7 |
|a UYA
|2 thema
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
100 |
1 |
|
|a Nipkow, Tobias.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
245 |
1 |
0 |
|a Concrete Semantics
|h [electronic resource] :
|b With Isabelle/HOL /
|c by Tobias Nipkow, Gerwin Klein.
|
250 |
|
|
|a 1st ed. 2014.
|
264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2014.
|
300 |
|
|
|a XIII, 298 p. 87 illus., 1 illus. in color.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
505 |
0 |
|
|a 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.
|
520 |
|
|
|a 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.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Compilers (Computer programs).
|
650 |
|
0 |
|a Machine theory.
|
650 |
1 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
650 |
2 |
4 |
|a Compilers and Interpreters.
|
650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
700 |
1 |
|
|a Klein, Gerwin.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319105437
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319105413
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319357591
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-319-10542-0
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|