000722887 000__ 03264cam\a2200505Ma\4500
000722887 001__ 722887
000722887 005__ 20230306140430.0
000722887 006__ m\\\\\\\\d\\\\\\\\
000722887 007__ cr\||\nnnunnun
000722887 008__ 150203s2014\\\\sz\a\\\\ob\\\\001\0\eng\d
000722887 020__ $$a9783319105420$$qelectronic book
000722887 020__ $$a3319105426$$qelectronic book
000722887 020__ $$z9783319105413 
000722887 020__ $$z3319105418
000722887 0247_ $$a10.1007/978-3-319-10542-0$$2doi
000722887 035__ $$aSP(OCoLC)ocn902703932
000722887 035__ $$aSP(OCoLC)902703932
000722887 040__ $$aDKDLA$$beng$$cDKDLA$$dUPM$$dOCLCO$$dCOO$$dGW5XE
000722887 049__ $$aISEA
000722887 050_4 $$aQA76.9.L63
000722887 08204 $$a005.1015113$$223
000722887 1001_ $$aNipkow, Tobias,$$eauthor.
000722887 24510 $$aConcrete semantics$$h[electronic resource] :$$bwith Isabelle/HOL /$$cTobias Nipkow, Gerwin Klein.
000722887 264_1 $$aCham :$$bSpringer,$$c2014
000722887 300__ $$a1 online resource (xiii, 298 p.) :$$bill.
000722887 336__ $$atext$$btxt$$2rdacontent
000722887 337__ $$acomputer$$bc$$2rdamedia
000722887 338__ $$aonline resource$$bcr$$2rdacarrier
000722887 347__ $$atext file$$bPDF$$2rda
000722887 504__ $$aIncludes bibliographical references and index.
000722887 5050_ $$aIntroduction -- 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
000722887 506__ $$aAccess limited to authorized users.
000722887 5208_ $$aPart 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
000722887 650_0 $$aAutomatic theorem proving.
000722887 650_0 $$aComputer science.
000722887 650_0 $$aLogic design.
000722887 650_0 $$aLogics and Meanings of Programs
000722887 650_0 $$aProgramming Languages, Compilers, Interpreters
000722887 650_0 $$aMathematical Logic and Formal Languages
000722887 7001_ $$aKlein, Gerwin,$$eauthor
000722887 77608 $$iPrint version:$$z9783319105413
000722887 852__ $$bebk
000722887 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-10542-0$$zOnline Access$$91397441.1
000722887 909CO $$ooai:library.usi.edu:722887$$pGLOBAL_SET
000722887 980__ $$aEBOOK
000722887 980__ $$aBIB
000722887 982__ $$aEbook
000722887 983__ $$aOnline
000722887 994__ $$a92$$bISE